java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv --cacsl2boogietranslator.bitprecise.bitfields false -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/list-ext-properties/list-ext_1_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-11 16:15:30,152 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 16:15:30,154 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 16:15:30,168 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 16:15:30,168 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 16:15:30,169 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 16:15:30,170 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 16:15:30,172 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 16:15:30,174 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 16:15:30,175 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 16:15:30,175 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 16:15:30,176 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 16:15:30,176 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 16:15:30,177 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 16:15:30,178 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 16:15:30,180 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 16:15:30,181 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 16:15:30,182 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 16:15:30,183 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 16:15:30,184 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 16:15:30,186 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 16:15:30,186 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 16:15:30,186 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 16:15:30,187 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 16:15:30,188 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 16:15:30,189 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 16:15:30,189 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 16:15:30,190 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 16:15:30,190 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 16:15:30,191 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 16:15:30,191 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 16:15:30,191 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-04-11 16:15:30,212 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 16:15:30,212 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 16:15:30,213 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 16:15:30,214 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 16:15:30,214 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 16:15:30,214 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 16:15:30,214 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 16:15:30,214 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 16:15:30,215 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 16:15:30,215 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 16:15:30,215 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 16:15:30,215 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 16:15:30,215 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 16:15:30,215 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 16:15:30,215 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 16:15:30,216 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 16:15:30,216 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 16:15:30,216 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 16:15:30,216 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 16:15:30,216 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 16:15:30,216 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 16:15:30,216 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-11 16:15:30,217 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-11 16:15:30,217 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-11 16:15:30,249 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 16:15:30,256 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 16:15:30,259 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 16:15:30,260 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 16:15:30,260 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 16:15:30,261 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,612 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG064a1314e [2018-04-11 16:15:30,751 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 16:15:30,751 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 16:15:30,752 INFO L168 CDTParser]: Scanning list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,759 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 16:15:30,760 INFO L215 ultiparseSymbolTable]: [2018-04-11 16:15:30,760 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 16:15:30,760 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,760 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_flist_ext___true_valid_memsafety_i__exit ('exit') in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,760 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 16:15:30,760 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i____time_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,760 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i__int8_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,761 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i____timer_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,761 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i__fsfilcnt_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,761 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i__size_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,761 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i____intptr_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,761 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i__u_int64_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,761 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i__caddr_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,761 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i__u_int in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,761 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i____mode_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,761 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i____fsfilcnt_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,761 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i__pthread_mutexattr_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,761 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i__u_short in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,761 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i__fsblkcnt_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,762 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i____int8_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,762 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i__gid_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,762 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i____blkcnt64_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,762 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i____int32_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,762 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i__key_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,762 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i____u_short in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,762 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i__int32_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,762 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i____uint64_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,762 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i__pid_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,762 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i__fd_set in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,762 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i____ssize_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,762 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i__timer_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,763 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i____dev_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,763 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i__mode_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,763 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i____sig_atomic_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,763 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i____nlink_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,763 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i____u_char in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,763 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i____caddr_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,763 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i__blksize_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,763 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i__pthread_attr_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,763 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i____off64_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,763 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i__pthread_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,763 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i____id_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,763 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i____fd_mask in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,764 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i__pthread_once_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,764 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i____uint32_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,764 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i____fsblkcnt64_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,764 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i____clockid_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,764 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i__u_char in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,764 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i__div_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,764 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i____u_long in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,764 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i____suseconds_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,764 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i__pthread_spinlock_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,764 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i__blkcnt_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,765 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i__quad_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,765 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i__off_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,765 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i____int16_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,765 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i__u_int16_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,765 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i__pthread_cond_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,765 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i__wchar_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,765 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i____rlim_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,765 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i__List in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,765 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i____socklen_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,765 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i__lldiv_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,766 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i__uid_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,766 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i__int16_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,766 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i____pthread_list_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,766 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i__u_long in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,766 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i____ino64_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,766 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i__pthread_barrier_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,766 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i____gid_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,766 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i____off_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,766 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i____quad_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,766 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i____fsid_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,767 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i__ushort in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,767 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i____u_quad_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,767 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i____sigset_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,767 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i__int64_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,767 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i____WAIT_STATUS in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,767 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i____pid_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,767 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i____uint16_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,767 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i____ino_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,767 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i____daddr_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,767 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i__clockid_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,768 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i__fsid_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,768 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i__ulong in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,768 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i__pthread_rwlockattr_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,768 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i____clock_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,768 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i____loff_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,768 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i__suseconds_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,768 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i__fd_mask in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,768 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i__clock_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,768 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i__u_int8_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,768 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i__daddr_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,768 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i__u_int32_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,768 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i____blksize_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,769 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i__pthread_key_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,769 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i__nlink_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,769 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i____uid_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,769 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i__u_quad_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,769 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i__ssize_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,769 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i____int64_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,769 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i__loff_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,769 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i__id_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,769 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i__uint in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,769 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i__pthread_condattr_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,769 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i__sigset_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,769 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i____qaddr_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,770 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i____rlim64_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,770 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i____uint8_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,770 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i__time_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,770 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i__dev_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,770 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i____swblk_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,770 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i____blkcnt_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,770 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i__ldiv_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,770 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i____key_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,770 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i____fsfilcnt64_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,770 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i__pthread_mutex_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,770 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i__ino_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,770 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i__pthread_rwlock_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,771 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i____u_int in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,771 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i____useconds_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,771 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i____fsblkcnt_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,771 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i__register_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,771 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flist_ext___true_valid_memsafety_i__pthread_barrierattr_t in list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:30,785 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG064a1314e [2018-04-11 16:15:30,789 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 16:15:30,790 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 16:15:30,790 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 16:15:30,790 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 16:15:30,795 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 16:15:30,796 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 04:15:30" (1/1) ... [2018-04-11 16:15:30,797 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43721594 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 04:15:30, skipping insertion in model container [2018-04-11 16:15:30,797 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 04:15:30" (1/1) ... [2018-04-11 16:15:30,809 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 16:15:30,836 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 16:15:30,974 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 16:15:31,013 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 16:15:31,020 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 113 non ball SCCs. Number of states in SCCs 113. [2018-04-11 16:15:31,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 04:15:31 WrapperNode [2018-04-11 16:15:31,052 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 16:15:31,053 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 16:15:31,053 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 16:15:31,053 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 16:15:31,066 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 04:15:31" (1/1) ... [2018-04-11 16:15:31,066 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 04:15:31" (1/1) ... [2018-04-11 16:15:31,079 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 04:15:31" (1/1) ... [2018-04-11 16:15:31,079 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 04:15:31" (1/1) ... [2018-04-11 16:15:31,089 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 04:15:31" (1/1) ... [2018-04-11 16:15:31,094 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 04:15:31" (1/1) ... [2018-04-11 16:15:31,096 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 04:15:31" (1/1) ... [2018-04-11 16:15:31,100 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 16:15:31,100 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 16:15:31,100 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 16:15:31,101 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 16:15:31,101 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 04:15:31" (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 16:15:31,190 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 16:15:31,190 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 16:15:31,190 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_flist_ext___true_valid_memsafety_i__exit [2018-04-11 16:15:31,190 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 16:15:31,190 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-11 16:15:31,190 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-11 16:15:31,191 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-11 16:15:31,191 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-11 16:15:31,191 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-11 16:15:31,191 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-11 16:15:31,191 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-11 16:15:31,191 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-11 16:15:31,191 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-11 16:15:31,191 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-11 16:15:31,192 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-11 16:15:31,192 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-11 16:15:31,192 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-11 16:15:31,192 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-11 16:15:31,192 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-11 16:15:31,192 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-11 16:15:31,192 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-11 16:15:31,192 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-11 16:15:31,192 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-11 16:15:31,193 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-11 16:15:31,193 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-11 16:15:31,193 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-11 16:15:31,193 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-11 16:15:31,193 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-11 16:15:31,193 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-11 16:15:31,193 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-11 16:15:31,193 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-11 16:15:31,193 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-11 16:15:31,194 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-11 16:15:31,194 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-11 16:15:31,194 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-11 16:15:31,194 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-11 16:15:31,194 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-11 16:15:31,194 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-11 16:15:31,194 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-11 16:15:31,194 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-11 16:15:31,194 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-11 16:15:31,195 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-11 16:15:31,195 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-11 16:15:31,195 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-11 16:15:31,195 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-11 16:15:31,195 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-11 16:15:31,195 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-11 16:15:31,195 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-11 16:15:31,195 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-11 16:15:31,195 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-11 16:15:31,196 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-11 16:15:31,196 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-11 16:15:31,196 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-11 16:15:31,196 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-11 16:15:31,196 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-11 16:15:31,196 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-11 16:15:31,196 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 16:15:31,196 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-11 16:15:31,196 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-11 16:15:31,196 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 16:15:31,197 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-11 16:15:31,197 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-11 16:15:31,197 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-11 16:15:31,197 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-11 16:15:31,197 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-11 16:15:31,198 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-11 16:15:31,198 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-11 16:15:31,198 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_flist_ext___true_valid_memsafety_i__exit [2018-04-11 16:15:31,199 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-11 16:15:31,199 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-11 16:15:31,199 INFO L128 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-04-11 16:15:31,199 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-11 16:15:31,199 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-11 16:15:31,199 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-11 16:15:31,199 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-11 16:15:31,199 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-11 16:15:31,199 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-11 16:15:31,199 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-11 16:15:31,200 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-11 16:15:31,200 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-11 16:15:31,200 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-11 16:15:31,200 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-11 16:15:31,200 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-11 16:15:31,200 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-11 16:15:31,200 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-11 16:15:31,200 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-11 16:15:31,200 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-11 16:15:31,200 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-11 16:15:31,200 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-11 16:15:31,201 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-11 16:15:31,201 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-11 16:15:31,201 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-11 16:15:31,201 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-11 16:15:31,201 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-11 16:15:31,201 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-11 16:15:31,201 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-11 16:15:31,201 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-11 16:15:31,201 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-11 16:15:31,201 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-11 16:15:31,202 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-11 16:15:31,202 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-11 16:15:31,202 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-11 16:15:31,202 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-11 16:15:31,202 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-11 16:15:31,202 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-11 16:15:31,202 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-11 16:15:31,202 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-11 16:15:31,202 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 16:15:31,202 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 16:15:31,203 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-11 16:15:31,203 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-11 16:15:31,203 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-11 16:15:31,203 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-11 16:15:31,203 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 16:15:31,203 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 16:15:31,203 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 16:15:31,203 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-11 16:15:31,552 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 16:15:31,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 04:15:31 BoogieIcfgContainer [2018-04-11 16:15:31,553 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 16:15:31,554 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 16:15:31,554 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 16:15:31,557 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 16:15:31,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 04:15:30" (1/3) ... [2018-04-11 16:15:31,563 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39d79e9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 04:15:31, skipping insertion in model container [2018-04-11 16:15:31,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 04:15:31" (2/3) ... [2018-04-11 16:15:31,563 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39d79e9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 04:15:31, skipping insertion in model container [2018-04-11 16:15:31,564 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 04:15:31" (3/3) ... [2018-04-11 16:15:31,565 INFO L107 eAbstractionObserver]: Analyzing ICFG list-ext_1_true-valid-memsafety.i [2018-04-11 16:15:31,573 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-11 16:15:31,580 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 35 error locations. [2018-04-11 16:15:31,614 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 16:15:31,614 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 16:15:31,614 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 16:15:31,614 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-11 16:15:31,614 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-11 16:15:31,615 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 16:15:31,615 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 16:15:31,615 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 16:15:31,615 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 16:15:31,616 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 16:15:31,628 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states. [2018-04-11 16:15:31,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-11 16:15:31,636 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:15:31,637 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:15:31,637 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 16:15:31,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1152381868, now seen corresponding path program 1 times [2018-04-11 16:15:31,641 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:15:31,641 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:15:31,671 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:15:31,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:15:31,671 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:15:31,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:15:31,702 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:15:31,727 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 16:15:31,728 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 16:15:31,729 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-11 16:15:31,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-04-11 16:15:31,739 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-04-11 16:15:31,739 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-04-11 16:15:31,741 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 2 states. [2018-04-11 16:15:31,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:15:31,760 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2018-04-11 16:15:31,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-04-11 16:15:31,761 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-04-11 16:15:31,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:15:31,769 INFO L225 Difference]: With dead ends: 106 [2018-04-11 16:15:31,770 INFO L226 Difference]: Without dead ends: 97 [2018-04-11 16:15:31,771 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-04-11 16:15:31,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-04-11 16:15:31,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-04-11 16:15:31,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-04-11 16:15:31,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 103 transitions. [2018-04-11 16:15:31,799 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 103 transitions. Word has length 13 [2018-04-11 16:15:31,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:15:31,799 INFO L459 AbstractCegarLoop]: Abstraction has 97 states and 103 transitions. [2018-04-11 16:15:31,799 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-04-11 16:15:31,799 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 103 transitions. [2018-04-11 16:15:31,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-11 16:15:31,800 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:15:31,800 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:15:31,800 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 16:15:31,800 INFO L82 PathProgramCache]: Analyzing trace with hash 629035797, now seen corresponding path program 1 times [2018-04-11 16:15:31,800 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:15:31,800 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:15:31,801 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:15:31,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:15:31,801 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:15:31,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:15:31,818 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:15:31,906 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 16:15:31,906 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 16:15:31,906 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 16:15:31,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 16:15:31,908 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 16:15:31,908 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 16:15:31,909 INFO L87 Difference]: Start difference. First operand 97 states and 103 transitions. Second operand 5 states. [2018-04-11 16:15:32,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:15:32,171 INFO L93 Difference]: Finished difference Result 167 states and 179 transitions. [2018-04-11 16:15:32,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 16:15:32,171 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-04-11 16:15:32,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:15:32,173 INFO L225 Difference]: With dead ends: 167 [2018-04-11 16:15:32,173 INFO L226 Difference]: Without dead ends: 167 [2018-04-11 16:15:32,174 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-11 16:15:32,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-04-11 16:15:32,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 135. [2018-04-11 16:15:32,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-04-11 16:15:32,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 163 transitions. [2018-04-11 16:15:32,184 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 163 transitions. Word has length 15 [2018-04-11 16:15:32,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:15:32,184 INFO L459 AbstractCegarLoop]: Abstraction has 135 states and 163 transitions. [2018-04-11 16:15:32,184 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 16:15:32,184 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 163 transitions. [2018-04-11 16:15:32,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-11 16:15:32,185 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:15:32,185 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:15:32,185 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 16:15:32,185 INFO L82 PathProgramCache]: Analyzing trace with hash 629035796, now seen corresponding path program 1 times [2018-04-11 16:15:32,185 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:15:32,186 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:15:32,186 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:15:32,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:15:32,187 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:15:32,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:15:32,196 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:15:32,221 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 16:15:32,221 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 16:15:32,222 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 16:15:32,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 16:15:32,222 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 16:15:32,222 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 16:15:32,223 INFO L87 Difference]: Start difference. First operand 135 states and 163 transitions. Second operand 5 states. [2018-04-11 16:15:32,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:15:32,343 INFO L93 Difference]: Finished difference Result 131 states and 144 transitions. [2018-04-11 16:15:32,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 16:15:32,343 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-04-11 16:15:32,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:15:32,344 INFO L225 Difference]: With dead ends: 131 [2018-04-11 16:15:32,344 INFO L226 Difference]: Without dead ends: 131 [2018-04-11 16:15:32,344 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-11 16:15:32,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-04-11 16:15:32,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 126. [2018-04-11 16:15:32,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-04-11 16:15:32,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 140 transitions. [2018-04-11 16:15:32,349 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 140 transitions. Word has length 15 [2018-04-11 16:15:32,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:15:32,349 INFO L459 AbstractCegarLoop]: Abstraction has 126 states and 140 transitions. [2018-04-11 16:15:32,349 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 16:15:32,349 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 140 transitions. [2018-04-11 16:15:32,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-11 16:15:32,350 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:15:32,350 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:15:32,350 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 16:15:32,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1028072899, now seen corresponding path program 1 times [2018-04-11 16:15:32,350 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:15:32,350 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:15:32,351 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:15:32,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:15:32,351 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:15:32,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:15:32,366 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:15:32,442 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:15:32,442 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 16:15:32,442 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 16:15:32,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 16:15:32,443 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 16:15:32,443 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-11 16:15:32,443 INFO L87 Difference]: Start difference. First operand 126 states and 140 transitions. Second operand 7 states. [2018-04-11 16:15:32,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:15:32,857 INFO L93 Difference]: Finished difference Result 261 states and 290 transitions. [2018-04-11 16:15:32,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 16:15:32,858 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-04-11 16:15:32,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:15:32,859 INFO L225 Difference]: With dead ends: 261 [2018-04-11 16:15:32,860 INFO L226 Difference]: Without dead ends: 261 [2018-04-11 16:15:32,860 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-04-11 16:15:32,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-04-11 16:15:32,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 124. [2018-04-11 16:15:32,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-04-11 16:15:32,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 142 transitions. [2018-04-11 16:15:32,872 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 142 transitions. Word has length 26 [2018-04-11 16:15:32,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:15:32,872 INFO L459 AbstractCegarLoop]: Abstraction has 124 states and 142 transitions. [2018-04-11 16:15:32,872 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 16:15:32,872 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 142 transitions. [2018-04-11 16:15:32,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-11 16:15:32,873 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:15:32,873 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:15:32,875 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 16:15:32,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1028072900, now seen corresponding path program 1 times [2018-04-11 16:15:32,875 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:15:32,875 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:15:32,876 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:15:32,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:15:32,876 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:15:32,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:15:32,888 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:15:32,933 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:15:32,934 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 16:15:32,934 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 16:15:32,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 16:15:32,934 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 16:15:32,934 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-11 16:15:32,934 INFO L87 Difference]: Start difference. First operand 124 states and 142 transitions. Second operand 7 states. [2018-04-11 16:15:33,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:15:33,151 INFO L93 Difference]: Finished difference Result 237 states and 264 transitions. [2018-04-11 16:15:33,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 16:15:33,152 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-04-11 16:15:33,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:15:33,153 INFO L225 Difference]: With dead ends: 237 [2018-04-11 16:15:33,153 INFO L226 Difference]: Without dead ends: 237 [2018-04-11 16:15:33,153 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-04-11 16:15:33,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-04-11 16:15:33,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 112. [2018-04-11 16:15:33,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-04-11 16:15:33,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 124 transitions. [2018-04-11 16:15:33,159 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 124 transitions. Word has length 26 [2018-04-11 16:15:33,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:15:33,159 INFO L459 AbstractCegarLoop]: Abstraction has 112 states and 124 transitions. [2018-04-11 16:15:33,159 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 16:15:33,159 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 124 transitions. [2018-04-11 16:15:33,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-11 16:15:33,160 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:15:33,160 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 16:15:33,160 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 16:15:33,161 INFO L82 PathProgramCache]: Analyzing trace with hash 774281829, now seen corresponding path program 1 times [2018-04-11 16:15:33,161 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:15:33,161 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:15:33,161 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:15:33,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:15:33,161 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:15:33,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:15:33,171 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:15:33,205 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 16:15:33,205 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 16:15:33,205 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 16:15:33,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 16:15:33,206 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 16:15:33,206 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 16:15:33,206 INFO L87 Difference]: Start difference. First operand 112 states and 124 transitions. Second operand 6 states. [2018-04-11 16:15:33,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:15:33,332 INFO L93 Difference]: Finished difference Result 207 states and 224 transitions. [2018-04-11 16:15:33,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 16:15:33,332 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-04-11 16:15:33,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:15:33,333 INFO L225 Difference]: With dead ends: 207 [2018-04-11 16:15:33,333 INFO L226 Difference]: Without dead ends: 207 [2018-04-11 16:15:33,333 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-04-11 16:15:33,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-04-11 16:15:33,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 126. [2018-04-11 16:15:33,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-04-11 16:15:33,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 142 transitions. [2018-04-11 16:15:33,338 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 142 transitions. Word has length 28 [2018-04-11 16:15:33,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:15:33,338 INFO L459 AbstractCegarLoop]: Abstraction has 126 states and 142 transitions. [2018-04-11 16:15:33,338 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 16:15:33,338 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 142 transitions. [2018-04-11 16:15:33,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-11 16:15:33,339 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:15:33,339 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:15:33,340 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 16:15:33,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1992576068, now seen corresponding path program 1 times [2018-04-11 16:15:33,340 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:15:33,340 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:15:33,341 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:15:33,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:15:33,341 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:15:33,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:15:33,353 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:15:33,390 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:15:33,390 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 16:15:33,390 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 16:15:33,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 16:15:33,391 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 16:15:33,391 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-11 16:15:33,391 INFO L87 Difference]: Start difference. First operand 126 states and 142 transitions. Second operand 7 states. [2018-04-11 16:15:33,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:15:33,563 INFO L93 Difference]: Finished difference Result 169 states and 189 transitions. [2018-04-11 16:15:33,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 16:15:33,564 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-04-11 16:15:33,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:15:33,564 INFO L225 Difference]: With dead ends: 169 [2018-04-11 16:15:33,564 INFO L226 Difference]: Without dead ends: 169 [2018-04-11 16:15:33,564 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-04-11 16:15:33,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-04-11 16:15:33,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 124. [2018-04-11 16:15:33,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-04-11 16:15:33,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 140 transitions. [2018-04-11 16:15:33,567 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 140 transitions. Word has length 30 [2018-04-11 16:15:33,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:15:33,567 INFO L459 AbstractCegarLoop]: Abstraction has 124 states and 140 transitions. [2018-04-11 16:15:33,567 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 16:15:33,568 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 140 transitions. [2018-04-11 16:15:33,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-11 16:15:33,568 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:15:33,568 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:15:33,568 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 16:15:33,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1992576067, now seen corresponding path program 1 times [2018-04-11 16:15:33,568 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:15:33,568 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:15:33,569 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:15:33,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:15:33,569 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:15:33,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:15:33,578 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:15:33,662 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:15:33,662 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 16:15:33,662 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 16:15:33,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 16:15:33,662 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 16:15:33,662 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-11 16:15:33,663 INFO L87 Difference]: Start difference. First operand 124 states and 140 transitions. Second operand 7 states. [2018-04-11 16:15:33,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:15:33,986 INFO L93 Difference]: Finished difference Result 184 states and 205 transitions. [2018-04-11 16:15:33,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 16:15:33,986 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-04-11 16:15:33,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:15:33,987 INFO L225 Difference]: With dead ends: 184 [2018-04-11 16:15:33,989 INFO L226 Difference]: Without dead ends: 184 [2018-04-11 16:15:33,990 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-04-11 16:15:33,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-04-11 16:15:33,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 107. [2018-04-11 16:15:33,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-04-11 16:15:33,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 121 transitions. [2018-04-11 16:15:33,994 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 121 transitions. Word has length 30 [2018-04-11 16:15:33,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:15:33,994 INFO L459 AbstractCegarLoop]: Abstraction has 107 states and 121 transitions. [2018-04-11 16:15:33,994 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 16:15:33,994 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 121 transitions. [2018-04-11 16:15:33,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-11 16:15:33,995 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:15:33,995 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 16:15:33,995 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 16:15:33,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1176636889, now seen corresponding path program 1 times [2018-04-11 16:15:33,995 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:15:33,996 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:15:33,996 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:15:33,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:15:33,996 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:15:34,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:15:34,005 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:15:34,054 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 16:15:34,054 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 16:15:34,054 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 16:15:34,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 16:15:34,055 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 16:15:34,055 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 16:15:34,055 INFO L87 Difference]: Start difference. First operand 107 states and 121 transitions. Second operand 6 states. [2018-04-11 16:15:34,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:15:34,176 INFO L93 Difference]: Finished difference Result 174 states and 187 transitions. [2018-04-11 16:15:34,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 16:15:34,176 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-04-11 16:15:34,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:15:34,177 INFO L225 Difference]: With dead ends: 174 [2018-04-11 16:15:34,177 INFO L226 Difference]: Without dead ends: 174 [2018-04-11 16:15:34,177 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-04-11 16:15:34,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-04-11 16:15:34,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 110. [2018-04-11 16:15:34,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-04-11 16:15:34,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 124 transitions. [2018-04-11 16:15:34,179 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 124 transitions. Word has length 31 [2018-04-11 16:15:34,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:15:34,179 INFO L459 AbstractCegarLoop]: Abstraction has 110 states and 124 transitions. [2018-04-11 16:15:34,179 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 16:15:34,179 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 124 transitions. [2018-04-11 16:15:34,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-11 16:15:34,180 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:15:34,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:15:34,180 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 16:15:34,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1359050271, now seen corresponding path program 1 times [2018-04-11 16:15:34,180 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:15:34,180 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:15:34,181 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:15:34,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:15:34,181 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:15:34,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:15:34,198 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:15:34,202 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:15:34,202 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:15:34,202 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:15:34,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:15:34,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:15:34,232 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:15:34,277 WARN L1033 $PredicateComparison]: unable to prove that (exists ((main_~p~0.base Int)) (and (= 0 (select |c_old(#valid)| main_~p~0.base)) (= (store |c_old(#valid)| main_~p~0.base 0) |c_#valid|))) is different from true [2018-04-11 16:15:34,286 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 16:15:34,287 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 16:15:34,287 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 16:15:34,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 16:15:34,287 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 16:15:34,288 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=22, Unknown=1, NotChecked=8, Total=42 [2018-04-11 16:15:34,288 INFO L87 Difference]: Start difference. First operand 110 states and 124 transitions. Second operand 7 states. [2018-04-11 16:15:34,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:15:34,445 INFO L93 Difference]: Finished difference Result 147 states and 162 transitions. [2018-04-11 16:15:34,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 16:15:34,445 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2018-04-11 16:15:34,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:15:34,446 INFO L225 Difference]: With dead ends: 147 [2018-04-11 16:15:34,446 INFO L226 Difference]: Without dead ends: 142 [2018-04-11 16:15:34,446 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=50, Unknown=2, NotChecked=14, Total=90 [2018-04-11 16:15:34,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-04-11 16:15:34,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 116. [2018-04-11 16:15:34,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-04-11 16:15:34,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 130 transitions. [2018-04-11 16:15:34,450 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 130 transitions. Word has length 38 [2018-04-11 16:15:34,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:15:34,450 INFO L459 AbstractCegarLoop]: Abstraction has 116 states and 130 transitions. [2018-04-11 16:15:34,450 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 16:15:34,450 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 130 transitions. [2018-04-11 16:15:34,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-11 16:15:34,451 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:15:34,451 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:15:34,452 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 16:15:34,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1537105453, now seen corresponding path program 1 times [2018-04-11 16:15:34,452 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:15:34,452 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:15:34,453 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:15:34,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:15:34,453 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:15:34,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:15:34,467 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:15:34,471 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:15:34,472 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:15:34,472 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:15:34,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:15:34,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:15:34,511 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:15:34,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:15:34,534 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:34,537 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:34,537 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 16:15:34,566 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 11 treesize of output 8 [2018-04-11 16:15:34,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 16:15:34,569 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:34,572 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:34,579 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:34,580 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-04-11 16:15:34,596 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:15:34,598 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:15:34,599 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 16:15:34,599 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:34,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:34,608 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:24 [2018-04-11 16:15:34,665 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 13 treesize of output 10 [2018-04-11 16:15:34,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:15:34,671 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:34,672 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:34,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:34,684 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2018-04-11 16:15:34,707 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 16:15:34,710 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 16 treesize of output 4 [2018-04-11 16:15:34,710 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:34,712 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:34,720 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 16:15:34,720 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:21 [2018-04-11 16:15:34,768 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 19 treesize of output 20 [2018-04-11 16:15:34,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 16:15:34,771 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:34,779 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:34,791 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 16:15:34,792 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:28 [2018-04-11 16:15:34,853 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 22 treesize of output 20 [2018-04-11 16:15:34,857 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:15:34,858 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 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-11 16:15:34,858 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:34,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 16:15:34,866 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:34,867 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:34,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:34,875 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:38, output treesize:3 [2018-04-11 16:15:34,893 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:15:34,893 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:15:34,894 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-11 16:15:34,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-11 16:15:34,894 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-11 16:15:34,894 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2018-04-11 16:15:34,894 INFO L87 Difference]: Start difference. First operand 116 states and 130 transitions. Second operand 14 states. [2018-04-11 16:15:35,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:15:35,562 INFO L93 Difference]: Finished difference Result 210 states and 228 transitions. [2018-04-11 16:15:35,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-11 16:15:35,562 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 39 [2018-04-11 16:15:35,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:15:35,563 INFO L225 Difference]: With dead ends: 210 [2018-04-11 16:15:35,563 INFO L226 Difference]: Without dead ends: 210 [2018-04-11 16:15:35,564 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=551, Unknown=0, NotChecked=0, Total=702 [2018-04-11 16:15:35,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-04-11 16:15:35,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 133. [2018-04-11 16:15:35,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-04-11 16:15:35,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 149 transitions. [2018-04-11 16:15:35,568 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 149 transitions. Word has length 39 [2018-04-11 16:15:35,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:15:35,568 INFO L459 AbstractCegarLoop]: Abstraction has 133 states and 149 transitions. [2018-04-11 16:15:35,568 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-11 16:15:35,568 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 149 transitions. [2018-04-11 16:15:35,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-11 16:15:35,569 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:15:35,569 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:15:35,569 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 16:15:35,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1624837059, now seen corresponding path program 1 times [2018-04-11 16:15:35,569 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:15:35,570 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:15:35,570 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:15:35,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:15:35,571 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:15:35,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:15:35,583 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:15:35,587 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:15:35,587 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:15:35,587 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:15:35,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:15:35,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:15:35,619 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:15:35,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 16:15:35,624 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:35,627 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:35,627 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 16:15:35,657 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:15:35,658 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:15:35,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-11 16:15:35,659 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:35,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:35,666 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-04-11 16:15:35,687 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 13 treesize of output 10 [2018-04-11 16:15:35,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:15:35,689 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:35,690 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:35,697 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:35,697 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:36 [2018-04-11 16:15:35,744 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2018-04-11 16:15:35,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 16:15:35,749 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:35,767 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:35,771 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 16:15:35,771 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:45 [2018-04-11 16:15:35,818 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2018-04-11 16:15:35,820 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 7 treesize of output 1 [2018-04-11 16:15:35,820 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:35,835 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:15:35,836 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2018-04-11 16:15:35,836 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:35,839 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:35,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:15:35,846 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:60, output treesize:15 [2018-04-11 16:15:35,874 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 16:15:35,875 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:15:35,875 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-11 16:15:35,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-11 16:15:35,875 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-11 16:15:35,875 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-04-11 16:15:35,876 INFO L87 Difference]: Start difference. First operand 133 states and 149 transitions. Second operand 15 states. [2018-04-11 16:15:36,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:15:36,658 INFO L93 Difference]: Finished difference Result 230 states and 256 transitions. [2018-04-11 16:15:36,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-11 16:15:36,659 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 39 [2018-04-11 16:15:36,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:15:36,660 INFO L225 Difference]: With dead ends: 230 [2018-04-11 16:15:36,660 INFO L226 Difference]: Without dead ends: 230 [2018-04-11 16:15:36,661 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=194, Invalid=618, Unknown=0, NotChecked=0, Total=812 [2018-04-11 16:15:36,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-04-11 16:15:36,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 158. [2018-04-11 16:15:36,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-04-11 16:15:36,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 180 transitions. [2018-04-11 16:15:36,664 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 180 transitions. Word has length 39 [2018-04-11 16:15:36,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:15:36,665 INFO L459 AbstractCegarLoop]: Abstraction has 158 states and 180 transitions. [2018-04-11 16:15:36,665 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-11 16:15:36,665 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 180 transitions. [2018-04-11 16:15:36,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-11 16:15:36,666 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:15:36,666 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:15:36,666 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 16:15:36,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1624837058, now seen corresponding path program 1 times [2018-04-11 16:15:36,666 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:15:36,666 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:15:36,667 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:15:36,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:15:36,667 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:15:36,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:15:36,680 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:15:36,684 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:15:36,684 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:15:36,684 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:15:36,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:15:36,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:15:36,713 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:15:36,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:15:36,716 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:36,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:15:36,721 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:36,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:36,724 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:11 [2018-04-11 16:15:36,753 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:15:36,753 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:15:36,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-11 16:15:36,754 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:36,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 16:15:36,763 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:36,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:36,771 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:24 [2018-04-11 16:15:36,795 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 13 treesize of output 10 [2018-04-11 16:15:36,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 9 [2018-04-11 16:15:36,797 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:36,798 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:36,809 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 13 treesize of output 10 [2018-04-11 16:15:36,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:15:36,811 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:36,813 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:36,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:36,824 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:54, output treesize:49 [2018-04-11 16:15:36,904 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 35 treesize of output 36 [2018-04-11 16:15:36,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 16:15:36,908 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:36,914 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:36,936 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 56 [2018-04-11 16:15:36,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 16:15:36,939 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:36,946 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:36,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 16:15:36,961 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:96, output treesize:76 [2018-04-11 16:15:37,072 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 52 [2018-04-11 16:15:37,075 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:15:37,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2018-04-11 16:15:37,075 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:37,082 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 7 treesize of output 1 [2018-04-11 16:15:37,082 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:37,086 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:37,100 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 16:15:37,102 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 7 treesize of output 1 [2018-04-11 16:15:37,103 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:37,108 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:15:37,108 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 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 16:15:37,109 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:37,111 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:37,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:15:37,120 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:104, output treesize:23 [2018-04-11 16:15:37,176 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 16:15:37,177 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:15:37,177 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-11 16:15:37,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 16:15:37,177 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 16:15:37,177 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-04-11 16:15:37,178 INFO L87 Difference]: Start difference. First operand 158 states and 180 transitions. Second operand 16 states. [2018-04-11 16:15:38,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:15:38,128 INFO L93 Difference]: Finished difference Result 256 states and 283 transitions. [2018-04-11 16:15:38,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-11 16:15:38,128 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 39 [2018-04-11 16:15:38,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:15:38,129 INFO L225 Difference]: With dead ends: 256 [2018-04-11 16:15:38,129 INFO L226 Difference]: Without dead ends: 256 [2018-04-11 16:15:38,130 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=206, Invalid=786, Unknown=0, NotChecked=0, Total=992 [2018-04-11 16:15:38,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-04-11 16:15:38,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 156. [2018-04-11 16:15:38,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-04-11 16:15:38,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 177 transitions. [2018-04-11 16:15:38,132 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 177 transitions. Word has length 39 [2018-04-11 16:15:38,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:15:38,132 INFO L459 AbstractCegarLoop]: Abstraction has 156 states and 177 transitions. [2018-04-11 16:15:38,132 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 16:15:38,132 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 177 transitions. [2018-04-11 16:15:38,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-11 16:15:38,132 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:15:38,132 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:15:38,133 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 16:15:38,133 INFO L82 PathProgramCache]: Analyzing trace with hash -60917604, now seen corresponding path program 1 times [2018-04-11 16:15:38,133 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:15:38,133 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:15:38,133 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:15:38,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:15:38,134 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:15:38,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:15:38,141 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:15:38,273 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 16:15:38,273 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 16:15:38,273 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 16:15:38,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 16:15:38,274 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 16:15:38,274 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-11 16:15:38,274 INFO L87 Difference]: Start difference. First operand 156 states and 177 transitions. Second operand 8 states. [2018-04-11 16:15:38,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:15:38,407 INFO L93 Difference]: Finished difference Result 177 states and 198 transitions. [2018-04-11 16:15:38,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 16:15:38,408 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2018-04-11 16:15:38,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:15:38,408 INFO L225 Difference]: With dead ends: 177 [2018-04-11 16:15:38,408 INFO L226 Difference]: Without dead ends: 162 [2018-04-11 16:15:38,408 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-04-11 16:15:38,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-04-11 16:15:38,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 141. [2018-04-11 16:15:38,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-04-11 16:15:38,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 161 transitions. [2018-04-11 16:15:38,411 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 161 transitions. Word has length 41 [2018-04-11 16:15:38,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:15:38,411 INFO L459 AbstractCegarLoop]: Abstraction has 141 states and 161 transitions. [2018-04-11 16:15:38,411 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 16:15:38,412 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 161 transitions. [2018-04-11 16:15:38,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-11 16:15:38,412 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:15:38,412 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:15:38,412 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 16:15:38,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1495501817, now seen corresponding path program 1 times [2018-04-11 16:15:38,413 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:15:38,413 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:15:38,413 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:15:38,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:15:38,414 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:15:38,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:15:38,424 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:15:38,427 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:15:38,427 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:15:38,427 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:15:38,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:15:38,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:15:38,453 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:15:38,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:15:38,467 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:38,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:38,470 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 16:15:38,497 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:15:38,497 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:15:38,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-11 16:15:38,499 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:38,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:38,510 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-04-11 16:15:38,537 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 13 treesize of output 10 [2018-04-11 16:15:38,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:15:38,540 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:38,543 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:38,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:38,553 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:36 [2018-04-11 16:15:38,588 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2018-04-11 16:15:38,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 16:15:38,590 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:38,593 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:38,598 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 16:15:38,598 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:45 [2018-04-11 16:15:38,672 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2018-04-11 16:15:38,675 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:15:38,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2018-04-11 16:15:38,676 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:38,684 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 7 treesize of output 1 [2018-04-11 16:15:38,684 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:38,687 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:38,697 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:15:38,697 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:60, output treesize:15 [2018-04-11 16:15:38,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 16:15:38,741 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:15:38,741 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-11 16:15:38,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-11 16:15:38,742 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-11 16:15:38,742 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-04-11 16:15:38,742 INFO L87 Difference]: Start difference. First operand 141 states and 161 transitions. Second operand 15 states. [2018-04-11 16:15:39,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:15:39,324 INFO L93 Difference]: Finished difference Result 206 states and 232 transitions. [2018-04-11 16:15:39,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-11 16:15:39,324 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 42 [2018-04-11 16:15:39,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:15:39,325 INFO L225 Difference]: With dead ends: 206 [2018-04-11 16:15:39,325 INFO L226 Difference]: Without dead ends: 206 [2018-04-11 16:15:39,325 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=194, Invalid=618, Unknown=0, NotChecked=0, Total=812 [2018-04-11 16:15:39,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-04-11 16:15:39,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 146. [2018-04-11 16:15:39,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-04-11 16:15:39,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 167 transitions. [2018-04-11 16:15:39,328 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 167 transitions. Word has length 42 [2018-04-11 16:15:39,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:15:39,329 INFO L459 AbstractCegarLoop]: Abstraction has 146 states and 167 transitions. [2018-04-11 16:15:39,329 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-11 16:15:39,329 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 167 transitions. [2018-04-11 16:15:39,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-11 16:15:39,329 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:15:39,330 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:15:39,330 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 16:15:39,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1495501818, now seen corresponding path program 1 times [2018-04-11 16:15:39,330 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:15:39,330 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:15:39,331 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:15:39,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:15:39,331 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:15:39,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:15:39,341 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:15:39,350 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:15:39,350 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:15:39,350 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:15:39,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:15:39,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:15:39,374 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:15:39,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:15:39,380 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:39,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:15:39,385 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:39,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:39,389 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:11 [2018-04-11 16:15:39,485 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:15:39,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 16:15:39,485 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:39,496 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:15:39,497 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:15:39,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-11 16:15:39,498 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:39,507 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:39,507 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:34 [2018-04-11 16:15:39,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 16:15:39,535 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:39,546 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 13 treesize of output 10 [2018-04-11 16:15:39,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:15:39,551 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:39,552 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:39,561 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 13 treesize of output 10 [2018-04-11 16:15:39,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:15:39,563 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:39,564 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:39,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:39,572 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:64, output treesize:49 [2018-04-11 16:15:39,623 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 66 [2018-04-11 16:15:39,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 16:15:39,625 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:39,630 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:39,647 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 35 treesize of output 36 [2018-04-11 16:15:39,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 16:15:39,650 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:39,653 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:39,662 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 16:15:39,662 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:96, output treesize:76 [2018-04-11 16:15:39,722 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 52 [2018-04-11 16:15:39,724 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:15:39,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2018-04-11 16:15:39,726 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:39,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-11 16:15:39,733 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:39,736 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:39,758 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 16:15:39,759 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:15:39,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 16:15:39,760 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:39,764 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 7 treesize of output 1 [2018-04-11 16:15:39,764 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:39,765 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:39,772 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:15:39,773 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:104, output treesize:23 [2018-04-11 16:15:39,810 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 16:15:39,810 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:15:39,810 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-11 16:15:39,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 16:15:39,811 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 16:15:39,811 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2018-04-11 16:15:39,811 INFO L87 Difference]: Start difference. First operand 146 states and 167 transitions. Second operand 16 states. [2018-04-11 16:15:40,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:15:40,587 INFO L93 Difference]: Finished difference Result 228 states and 253 transitions. [2018-04-11 16:15:40,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-11 16:15:40,588 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 42 [2018-04-11 16:15:40,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:15:40,588 INFO L225 Difference]: With dead ends: 228 [2018-04-11 16:15:40,588 INFO L226 Difference]: Without dead ends: 228 [2018-04-11 16:15:40,589 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=212, Invalid=780, Unknown=0, NotChecked=0, Total=992 [2018-04-11 16:15:40,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-04-11 16:15:40,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 146. [2018-04-11 16:15:40,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-04-11 16:15:40,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 167 transitions. [2018-04-11 16:15:40,591 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 167 transitions. Word has length 42 [2018-04-11 16:15:40,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:15:40,591 INFO L459 AbstractCegarLoop]: Abstraction has 146 states and 167 transitions. [2018-04-11 16:15:40,591 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 16:15:40,591 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 167 transitions. [2018-04-11 16:15:40,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-11 16:15:40,591 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:15:40,591 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:15:40,591 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 16:15:40,591 INFO L82 PathProgramCache]: Analyzing trace with hash -776656561, now seen corresponding path program 1 times [2018-04-11 16:15:40,592 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:15:40,592 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:15:40,592 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:15:40,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:15:40,592 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:15:40,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:15:40,600 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:15:40,603 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:15:40,603 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:15:40,603 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:15:40,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:15:40,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:15:40,624 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:15:40,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 16:15:40,632 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:40,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:15:40,640 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:40,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:40,642 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 16:15:40,657 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 11 treesize of output 8 [2018-04-11 16:15:40,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 16:15:40,658 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:40,659 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:40,664 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:40,664 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-04-11 16:15:40,674 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:15:40,675 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 16:15:40,675 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:40,684 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:15:40,684 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:15:40,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-11 16:15:40,685 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:40,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:40,702 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31 [2018-04-11 16:15:40,725 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 13 treesize of output 10 [2018-04-11 16:15:40,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:15:40,728 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:40,730 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:40,737 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:40,737 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:43 [2018-04-11 16:15:40,752 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 31 treesize of output 25 [2018-04-11 16:15:40,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 10 [2018-04-11 16:15:40,753 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:40,755 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:40,760 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 16:15:40,760 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:28 [2018-04-11 16:15:40,815 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 19 treesize of output 20 [2018-04-11 16:15:40,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 16:15:40,817 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:40,827 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:40,834 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 16:15:40,835 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2018-04-11 16:15:40,892 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 22 treesize of output 20 [2018-04-11 16:15:40,897 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 12 [2018-04-11 16:15:40,898 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 16:15:40,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 16:15:40,903 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:40,906 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 16:15:40,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 16:15:40,914 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:45, output treesize:49 [2018-04-11 16:15:40,978 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:15:40,978 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:15:40,978 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-11 16:15:40,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 16:15:40,979 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 16:15:40,979 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2018-04-11 16:15:40,979 INFO L87 Difference]: Start difference. First operand 146 states and 167 transitions. Second operand 16 states. [2018-04-11 16:15:41,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:15:41,823 INFO L93 Difference]: Finished difference Result 245 states and 272 transitions. [2018-04-11 16:15:41,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 16:15:41,823 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 42 [2018-04-11 16:15:41,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:15:41,824 INFO L225 Difference]: With dead ends: 245 [2018-04-11 16:15:41,824 INFO L226 Difference]: Without dead ends: 245 [2018-04-11 16:15:41,824 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=170, Invalid=700, Unknown=0, NotChecked=0, Total=870 [2018-04-11 16:15:41,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-04-11 16:15:41,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 149. [2018-04-11 16:15:41,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-04-11 16:15:41,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 170 transitions. [2018-04-11 16:15:41,828 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 170 transitions. Word has length 42 [2018-04-11 16:15:41,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:15:41,828 INFO L459 AbstractCegarLoop]: Abstraction has 149 states and 170 transitions. [2018-04-11 16:15:41,828 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 16:15:41,828 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 170 transitions. [2018-04-11 16:15:41,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-11 16:15:41,828 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:15:41,829 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, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:15:41,829 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 16:15:41,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1280833353, now seen corresponding path program 2 times [2018-04-11 16:15:41,829 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:15:41,829 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:15:41,830 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:15:41,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:15:41,830 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:15:41,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:15:41,839 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:15:41,841 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:15:41,841 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:15:41,841 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:15:41,841 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 16:15:41,866 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 16:15:41,866 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:15:41,870 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:15:41,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:15:41,876 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:41,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:41,879 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 16:15:41,907 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:15:41,908 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:15:41,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-11 16:15:41,909 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:41,921 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 16:15:41,921 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:41,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:41,932 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-04-11 16:15:41,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 16:15:41,971 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:41,987 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 13 treesize of output 10 [2018-04-11 16:15:41,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:15:41,989 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:41,991 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:42,005 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 13 treesize of output 10 [2018-04-11 16:15:42,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:15:42,007 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:42,008 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:42,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:42,019 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:55, output treesize:45 [2018-04-11 16:15:42,113 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 11 treesize of output 14 [2018-04-11 16:15:42,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 19 [2018-04-11 16:15:42,115 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:42,116 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:42,127 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 16:15:42,127 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:74, output treesize:79 [2018-04-11 16:15:42,160 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 97 [2018-04-11 16:15:42,163 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-04-11 16:15:42,163 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:42,172 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:42,192 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 81 treesize of output 82 [2018-04-11 16:15:42,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-04-11 16:15:42,195 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:42,203 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:42,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:15:42,218 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:123, output treesize:103 [2018-04-11 16:15:42,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 14 [2018-04-11 16:15:42,315 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:42,335 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 72 [2018-04-11 16:15:42,338 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 13 treesize of output 1 [2018-04-11 16:15:42,338 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:42,347 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:15:42,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 40 [2018-04-11 16:15:42,348 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:42,354 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:42,370 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 47 treesize of output 41 [2018-04-11 16:15:42,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-04-11 16:15:42,372 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:42,380 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:15:42,380 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 0 case distinctions, treesize of input 26 treesize of output 18 [2018-04-11 16:15:42,381 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:42,385 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:42,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:42,395 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:131, output treesize:11 [2018-04-11 16:15:42,437 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 15 treesize of output 11 [2018-04-11 16:15:42,438 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:15:42,439 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 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-11 16:15:42,439 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:42,442 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:42,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:42,446 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:3 [2018-04-11 16:15:42,470 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:15:42,470 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:15:42,471 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-11 16:15:42,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 16:15:42,471 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 16:15:42,471 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2018-04-11 16:15:42,471 INFO L87 Difference]: Start difference. First operand 149 states and 170 transitions. Second operand 18 states. [2018-04-11 16:15:43,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:15:43,419 INFO L93 Difference]: Finished difference Result 241 states and 264 transitions. [2018-04-11 16:15:43,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-11 16:15:43,419 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 44 [2018-04-11 16:15:43,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:15:43,420 INFO L225 Difference]: With dead ends: 241 [2018-04-11 16:15:43,420 INFO L226 Difference]: Without dead ends: 241 [2018-04-11 16:15:43,421 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=219, Invalid=971, Unknown=0, NotChecked=0, Total=1190 [2018-04-11 16:15:43,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-04-11 16:15:43,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 152. [2018-04-11 16:15:43,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-04-11 16:15:43,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 173 transitions. [2018-04-11 16:15:43,423 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 173 transitions. Word has length 44 [2018-04-11 16:15:43,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:15:43,423 INFO L459 AbstractCegarLoop]: Abstraction has 152 states and 173 transitions. [2018-04-11 16:15:43,423 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 16:15:43,423 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 173 transitions. [2018-04-11 16:15:43,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-11 16:15:43,423 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:15:43,423 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:15:43,423 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 16:15:43,423 INFO L82 PathProgramCache]: Analyzing trace with hash -992636466, now seen corresponding path program 2 times [2018-04-11 16:15:43,423 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:15:43,424 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:15:43,424 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:15:43,424 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:15:43,424 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:15:43,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:15:43,431 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:15:43,434 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:15:43,434 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:15:43,434 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:15:43,434 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 16:15:43,451 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 16:15:43,452 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:15:43,455 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:15:43,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:15:43,484 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:43,489 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:15:43,489 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:43,493 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:43,493 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 16:15:43,525 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:15:43,526 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:15:43,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-11 16:15:43,527 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:43,537 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 16:15:43,537 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:43,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:43,546 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-04-11 16:15:43,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 8 [2018-04-11 16:15:43,575 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:43,589 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 13 treesize of output 10 [2018-04-11 16:15:43,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 9 [2018-04-11 16:15:43,591 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:43,592 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:43,603 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 13 treesize of output 10 [2018-04-11 16:15:43,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:15:43,605 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:43,606 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:43,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:43,623 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:57, output treesize:32 [2018-04-11 16:15:43,709 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 11 treesize of output 14 [2018-04-11 16:15:43,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 19 [2018-04-11 16:15:43,711 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:43,713 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:43,725 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 16:15:43,726 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:66 [2018-04-11 16:15:43,753 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 91 treesize of output 92 [2018-04-11 16:15:43,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-04-11 16:15:43,755 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:43,764 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:43,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 76 [2018-04-11 16:15:43,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-04-11 16:15:43,785 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:43,792 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:43,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:15:43,806 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:110, output treesize:90 [2018-04-11 16:15:43,865 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 70 [2018-04-11 16:15:43,868 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:15:43,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 38 [2018-04-11 16:15:43,869 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:43,877 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 13 treesize of output 1 [2018-04-11 16:15:43,877 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:43,881 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:43,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-04-11 16:15:43,897 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:15:43,898 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 0 case distinctions, treesize of input 35 treesize of output 21 [2018-04-11 16:15:43,898 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:43,905 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 16:15:43,905 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:43,910 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:43,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:43,916 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:101, output treesize:11 [2018-04-11 16:15:43,956 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 15 treesize of output 11 [2018-04-11 16:15:43,962 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:15:43,962 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 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-11 16:15:43,962 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:43,964 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:43,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:43,968 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:3 [2018-04-11 16:15:43,995 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:15:43,995 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:15:43,995 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-11 16:15:43,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 16:15:43,996 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 16:15:43,996 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-04-11 16:15:43,996 INFO L87 Difference]: Start difference. First operand 152 states and 173 transitions. Second operand 17 states. [2018-04-11 16:15:44,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:15:44,859 INFO L93 Difference]: Finished difference Result 216 states and 238 transitions. [2018-04-11 16:15:44,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 16:15:44,859 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 47 [2018-04-11 16:15:44,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:15:44,860 INFO L225 Difference]: With dead ends: 216 [2018-04-11 16:15:44,860 INFO L226 Difference]: Without dead ends: 216 [2018-04-11 16:15:44,860 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=169, Invalid=761, Unknown=0, NotChecked=0, Total=930 [2018-04-11 16:15:44,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-04-11 16:15:44,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 152. [2018-04-11 16:15:44,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-04-11 16:15:44,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 173 transitions. [2018-04-11 16:15:44,862 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 173 transitions. Word has length 47 [2018-04-11 16:15:44,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:15:44,862 INFO L459 AbstractCegarLoop]: Abstraction has 152 states and 173 transitions. [2018-04-11 16:15:44,862 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 16:15:44,862 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 173 transitions. [2018-04-11 16:15:44,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-11 16:15:44,862 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:15:44,863 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:15:44,863 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 16:15:44,863 INFO L82 PathProgramCache]: Analyzing trace with hash -354219371, now seen corresponding path program 1 times [2018-04-11 16:15:44,863 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:15:44,863 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:15:44,863 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:15:44,863 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:15:44,863 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:15:44,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:15:44,872 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:15:44,874 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:15:44,875 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:15:44,875 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:15:44,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:15:44,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:15:44,900 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:15:44,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 16:15:44,908 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:44,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 16:15:44,913 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:44,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:44,917 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 16:15:44,955 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:15:44,956 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:15:44,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-11 16:15:44,957 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:44,966 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 16:15:44,966 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:44,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:44,973 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:24 [2018-04-11 16:15:45,002 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 13 treesize of output 10 [2018-04-11 16:15:45,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:15:45,004 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:45,005 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:45,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:45,014 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:36 [2018-04-11 16:15:45,081 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 11 treesize of output 14 [2018-04-11 16:15:45,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 16:15:45,083 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:45,085 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:45,098 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 16:15:45,098 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:58 [2018-04-11 16:15:45,128 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 67 [2018-04-11 16:15:45,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 16:15:45,131 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:45,139 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:45,154 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 16:15:45,155 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:87, output treesize:77 [2018-04-11 16:15:45,255 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 61 [2018-04-11 16:15:45,258 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:15:45,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 31 [2018-04-11 16:15:45,259 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:45,269 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 7 treesize of output 1 [2018-04-11 16:15:45,269 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:45,275 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:45,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 16:15:45,290 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:96, output treesize:37 [2018-04-11 16:15:45,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 16:15:45,409 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 12 [2018-04-11 16:15:45,409 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 16:15:45,413 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 16:15:45,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 16:15:45,423 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:68 [2018-04-11 16:15:45,552 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:15:45,553 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:15:45,553 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-11 16:15:45,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 16:15:45,553 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 16:15:45,553 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=336, Unknown=2, NotChecked=0, Total=380 [2018-04-11 16:15:45,554 INFO L87 Difference]: Start difference. First operand 152 states and 173 transitions. Second operand 20 states. [2018-04-11 16:15:46,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:15:46,870 INFO L93 Difference]: Finished difference Result 223 states and 244 transitions. [2018-04-11 16:15:46,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 16:15:46,871 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 47 [2018-04-11 16:15:46,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:15:46,871 INFO L225 Difference]: With dead ends: 223 [2018-04-11 16:15:46,871 INFO L226 Difference]: Without dead ends: 222 [2018-04-11 16:15:46,872 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=227, Invalid=1175, Unknown=4, NotChecked=0, Total=1406 [2018-04-11 16:15:46,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-04-11 16:15:46,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 152. [2018-04-11 16:15:46,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-04-11 16:15:46,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 173 transitions. [2018-04-11 16:15:46,876 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 173 transitions. Word has length 47 [2018-04-11 16:15:46,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:15:46,876 INFO L459 AbstractCegarLoop]: Abstraction has 152 states and 173 transitions. [2018-04-11 16:15:46,876 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 16:15:46,876 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 173 transitions. [2018-04-11 16:15:46,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-11 16:15:46,877 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:15:46,877 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:15:46,877 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 16:15:46,877 INFO L82 PathProgramCache]: Analyzing trace with hash 312582095, now seen corresponding path program 1 times [2018-04-11 16:15:46,877 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:15:46,878 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:15:46,879 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:15:46,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:15:46,879 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:15:46,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:15:46,889 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:15:46,895 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:15:46,895 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:15:46,895 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:15:46,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:15:46,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:15:46,920 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:15:46,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:15:46,932 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:46,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:46,935 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 16:15:46,972 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:15:46,973 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:15:46,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-11 16:15:46,974 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:46,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:46,981 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-04-11 16:15:47,019 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 16:15:47,020 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:47,027 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 13 treesize of output 10 [2018-04-11 16:15:47,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:15:47,028 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:47,029 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:47,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:47,034 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:41, output treesize:30 [2018-04-11 16:15:47,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2018-04-11 16:15:47,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 16:15:47,072 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:47,075 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:47,081 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 16:15:47,081 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:42 [2018-04-11 16:15:47,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 38 [2018-04-11 16:15:47,124 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 7 treesize of output 1 [2018-04-11 16:15:47,125 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:47,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 21 [2018-04-11 16:15:47,139 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 16:15:47,143 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 16:15:47,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-11 16:15:47,152 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:51, output treesize:13 [2018-04-11 16:15:47,191 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:15:47,191 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:15:47,191 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-11 16:15:47,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 16:15:47,192 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 16:15:47,192 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-04-11 16:15:47,192 INFO L87 Difference]: Start difference. First operand 152 states and 173 transitions. Second operand 16 states. [2018-04-11 16:15:47,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:15:47,835 INFO L93 Difference]: Finished difference Result 210 states and 231 transitions. [2018-04-11 16:15:47,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 16:15:47,836 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 49 [2018-04-11 16:15:47,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:15:47,836 INFO L225 Difference]: With dead ends: 210 [2018-04-11 16:15:47,836 INFO L226 Difference]: Without dead ends: 209 [2018-04-11 16:15:47,837 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=208, Invalid=848, Unknown=0, NotChecked=0, Total=1056 [2018-04-11 16:15:47,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-04-11 16:15:47,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 161. [2018-04-11 16:15:47,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-04-11 16:15:47,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 182 transitions. [2018-04-11 16:15:47,840 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 182 transitions. Word has length 49 [2018-04-11 16:15:47,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:15:47,840 INFO L459 AbstractCegarLoop]: Abstraction has 161 states and 182 transitions. [2018-04-11 16:15:47,840 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 16:15:47,840 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 182 transitions. [2018-04-11 16:15:47,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-11 16:15:47,841 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:15:47,841 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:15:47,841 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 16:15:47,841 INFO L82 PathProgramCache]: Analyzing trace with hash 52065721, now seen corresponding path program 1 times [2018-04-11 16:15:47,841 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:15:47,842 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:15:47,842 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:15:47,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:15:47,842 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:15:47,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:15:47,850 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:15:47,853 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:15:47,853 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:15:47,854 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:15:47,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:15:47,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:15:47,873 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:15:47,887 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:15:47,887 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:47,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:15:47,892 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:47,895 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:47,895 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:11 [2018-04-11 16:15:47,925 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:15:47,926 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 16:15:47,927 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:47,939 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:15:47,940 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:15:47,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-11 16:15:47,941 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:47,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:47,948 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:24 [2018-04-11 16:15:48,006 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 18 treesize of output 8 [2018-04-11 16:15:48,006 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:48,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 16:15:48,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:15:48,019 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:48,021 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:48,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:48,028 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:45, output treesize:30 [2018-04-11 16:15:48,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2018-04-11 16:15:48,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 16:15:48,092 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:48,095 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:48,103 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 16:15:48,103 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:42 [2018-04-11 16:15:48,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 38 [2018-04-11 16:15:48,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 21 [2018-04-11 16:15:48,141 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 16:15:48,146 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 7 treesize of output 1 [2018-04-11 16:15:48,147 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:48,149 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 16:15:48,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-11 16:15:48,154 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:51, output treesize:13 [2018-04-11 16:15:48,179 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:15:48,179 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:15:48,179 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-11 16:15:48,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 16:15:48,179 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 16:15:48,180 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2018-04-11 16:15:48,180 INFO L87 Difference]: Start difference. First operand 161 states and 182 transitions. Second operand 16 states. [2018-04-11 16:15:48,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:15:48,937 INFO L93 Difference]: Finished difference Result 225 states and 246 transitions. [2018-04-11 16:15:48,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-11 16:15:48,937 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 49 [2018-04-11 16:15:48,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:15:48,937 INFO L225 Difference]: With dead ends: 225 [2018-04-11 16:15:48,938 INFO L226 Difference]: Without dead ends: 224 [2018-04-11 16:15:48,938 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=218, Invalid=904, Unknown=0, NotChecked=0, Total=1122 [2018-04-11 16:15:48,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-04-11 16:15:48,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 158. [2018-04-11 16:15:48,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-04-11 16:15:48,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 179 transitions. [2018-04-11 16:15:48,940 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 179 transitions. Word has length 49 [2018-04-11 16:15:48,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:15:48,940 INFO L459 AbstractCegarLoop]: Abstraction has 158 states and 179 transitions. [2018-04-11 16:15:48,940 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 16:15:48,940 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 179 transitions. [2018-04-11 16:15:48,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-11 16:15:48,940 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:15:48,940 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:15:48,940 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 16:15:48,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1256109659, now seen corresponding path program 2 times [2018-04-11 16:15:48,941 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:15:48,941 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:15:48,941 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:15:48,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:15:48,941 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:15:48,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:15:48,949 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:15:48,952 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:15:48,952 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:15:48,952 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:15:48,953 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 16:15:48,992 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 16:15:48,992 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:15:48,995 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:15:48,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 16:15:48,998 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:49,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:15:49,004 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:49,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:49,013 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 16:15:49,027 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 11 treesize of output 8 [2018-04-11 16:15:49,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 16:15:49,028 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:49,029 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:49,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:49,034 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:27 [2018-04-11 16:15:49,044 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:15:49,044 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 16:15:49,044 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:49,053 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:15:49,053 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:15:49,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-11 16:15:49,054 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:49,059 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:49,059 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31 [2018-04-11 16:15:49,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 8 [2018-04-11 16:15:49,078 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:49,086 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 13 treesize of output 10 [2018-04-11 16:15:49,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:15:49,088 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:49,089 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:49,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:49,098 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:56, output treesize:35 [2018-04-11 16:15:49,138 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:15:49,140 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 19 treesize of output 26 [2018-04-11 16:15:49,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 16:15:49,142 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:49,145 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:49,155 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 16:15:49,155 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:57, output treesize:59 [2018-04-11 16:15:49,195 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:15:49,196 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:15:49,197 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:15:49,198 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:15:49,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-11 16:15:49,199 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:49,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:15:49,211 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:64, output treesize:57 [2018-04-11 16:15:49,247 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:15:49,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2018-04-11 16:15:49,251 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:15:49,251 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:49,256 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:49,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:15:49,266 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:70, output treesize:69 [2018-04-11 16:15:49,286 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 54 [2018-04-11 16:15:49,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 13 [2018-04-11 16:15:49,288 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:49,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2018-04-11 16:15:49,293 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:15:49,301 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:15:49,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 16:15:49,308 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:93, output treesize:36 [2018-04-11 16:15:49,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2018-04-11 16:15:49,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 16:15:49,389 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:49,396 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:49,409 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-04-11 16:15:49,409 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:47, output treesize:43 [2018-04-11 16:15:49,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2018-04-11 16:15:49,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 16:15:49,481 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:49,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 16:15:49,491 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:49,495 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:15:49,496 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 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-11 16:15:49,496 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:49,499 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:49,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:49,506 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:53, output treesize:3 [2018-04-11 16:15:49,528 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:15:49,528 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:15:49,528 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-11 16:15:49,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 16:15:49,528 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 16:15:49,528 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2018-04-11 16:15:49,529 INFO L87 Difference]: Start difference. First operand 158 states and 179 transitions. Second operand 20 states. [2018-04-11 16:15:50,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:15:50,800 INFO L93 Difference]: Finished difference Result 251 states and 276 transitions. [2018-04-11 16:15:50,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-11 16:15:50,800 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 50 [2018-04-11 16:15:50,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:15:50,801 INFO L225 Difference]: With dead ends: 251 [2018-04-11 16:15:50,801 INFO L226 Difference]: Without dead ends: 251 [2018-04-11 16:15:50,801 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=243, Invalid=1317, Unknown=0, NotChecked=0, Total=1560 [2018-04-11 16:15:50,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-04-11 16:15:50,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 175. [2018-04-11 16:15:50,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-04-11 16:15:50,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 198 transitions. [2018-04-11 16:15:50,803 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 198 transitions. Word has length 50 [2018-04-11 16:15:50,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:15:50,803 INFO L459 AbstractCegarLoop]: Abstraction has 175 states and 198 transitions. [2018-04-11 16:15:50,803 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 16:15:50,803 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 198 transitions. [2018-04-11 16:15:50,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-11 16:15:50,803 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:15:50,804 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:15:50,804 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 16:15:50,804 INFO L82 PathProgramCache]: Analyzing trace with hash -742182661, now seen corresponding path program 1 times [2018-04-11 16:15:50,804 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:15:50,804 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:15:50,804 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:15:50,804 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:15:50,804 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:15:50,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:15:50,814 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:15:50,817 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:15:50,818 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:15:50,818 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:15:50,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:15:50,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:15:50,853 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:15:50,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 16:15:50,856 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:50,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 16:15:50,860 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:50,862 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:50,862 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:11 [2018-04-11 16:15:50,914 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:15:50,915 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:15:50,916 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-11 16:15:50,916 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:50,927 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 16:15:50,928 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:50,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:50,936 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:31 [2018-04-11 16:15:50,958 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 13 treesize of output 10 [2018-04-11 16:15:50,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:15:50,959 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:50,961 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:50,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:50,969 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:56 [2018-04-11 16:15:51,023 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:15:51,024 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:15:51,025 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:15:51,025 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 32 [2018-04-11 16:15:51,025 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:51,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 53 [2018-04-11 16:15:51,037 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:51,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:15:51,045 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:73, output treesize:65 [2018-04-11 16:15:51,074 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:15:51,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 55 [2018-04-11 16:15:51,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:15:51,078 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:51,083 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:51,094 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:15:51,094 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:83, output treesize:88 [2018-04-11 16:15:51,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 98 [2018-04-11 16:15:51,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-04-11 16:15:51,166 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:51,173 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:51,184 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 16:15:51,184 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:140, output treesize:124 [2018-04-11 16:15:51,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 55 [2018-04-11 16:15:51,256 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:51,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 66 [2018-04-11 16:15:51,269 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 7 treesize of output 1 [2018-04-11 16:15:51,269 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:51,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-04-11 16:15:51,275 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:51,279 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:15:51,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2018-04-11 16:15:51,279 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:51,282 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:51,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:51,286 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:143, output treesize:5 [2018-04-11 16:15:51,321 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:15:51,321 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:15:51,321 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-11 16:15:51,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-11 16:15:51,322 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-11 16:15:51,322 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2018-04-11 16:15:51,322 INFO L87 Difference]: Start difference. First operand 175 states and 198 transitions. Second operand 21 states. [2018-04-11 16:15:52,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:15:52,657 INFO L93 Difference]: Finished difference Result 290 states and 319 transitions. [2018-04-11 16:15:52,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-11 16:15:52,657 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 50 [2018-04-11 16:15:52,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:15:52,658 INFO L225 Difference]: With dead ends: 290 [2018-04-11 16:15:52,658 INFO L226 Difference]: Without dead ends: 290 [2018-04-11 16:15:52,658 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=340, Invalid=1640, Unknown=0, NotChecked=0, Total=1980 [2018-04-11 16:15:52,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-04-11 16:15:52,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 196. [2018-04-11 16:15:52,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-04-11 16:15:52,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 223 transitions. [2018-04-11 16:15:52,660 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 223 transitions. Word has length 50 [2018-04-11 16:15:52,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:15:52,660 INFO L459 AbstractCegarLoop]: Abstraction has 196 states and 223 transitions. [2018-04-11 16:15:52,660 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-11 16:15:52,660 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 223 transitions. [2018-04-11 16:15:52,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-11 16:15:52,661 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:15:52,661 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:15:52,661 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 16:15:52,661 INFO L82 PathProgramCache]: Analyzing trace with hash -742182660, now seen corresponding path program 1 times [2018-04-11 16:15:52,661 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:15:52,661 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:15:52,661 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:15:52,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:15:52,662 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:15:52,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:15:52,669 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:15:52,678 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:15:52,678 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:15:52,678 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:15:52,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:15:52,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:15:52,701 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:15:52,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 16:15:52,703 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:52,707 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 16:15:52,707 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:52,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:52,725 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 16:15:52,753 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:15:52,753 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 16:15:52,753 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:52,779 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:15:52,779 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:15:52,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-11 16:15:52,780 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:52,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:52,786 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-04-11 16:15:52,809 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 13 treesize of output 10 [2018-04-11 16:15:52,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 9 [2018-04-11 16:15:52,811 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:52,812 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:52,825 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 13 treesize of output 10 [2018-04-11 16:15:52,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:15:52,827 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:52,829 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:52,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:52,840 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:62, output treesize:57 [2018-04-11 16:15:52,928 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:15:52,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 43 [2018-04-11 16:15:52,929 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:52,942 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:15:52,943 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:15:52,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-11 16:15:52,943 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:52,956 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:15:52,956 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:77, output treesize:70 [2018-04-11 16:15:52,992 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:15:52,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 30 [2018-04-11 16:15:52,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 16:15:52,996 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:53,000 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:53,016 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:15:53,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 60 [2018-04-11 16:15:53,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:15:53,020 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:53,026 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:53,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:15:53,039 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:103, output treesize:79 [2018-04-11 16:15:53,126 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:15:53,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 132 treesize of output 116 [2018-04-11 16:15:53,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 148 [2018-04-11 16:15:53,149 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:53,195 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 99 [2018-04-11 16:15:53,195 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 16:15:53,224 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 16:15:53,252 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 125 treesize of output 110 [2018-04-11 16:15:53,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-04-11 16:15:53,254 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:53,264 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:53,268 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 91 treesize of output 82 [2018-04-11 16:15:53,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 16:15:53,270 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:53,276 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:53,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-04-11 16:15:53,302 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:162, output treesize:226 [2018-04-11 16:15:53,453 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:15:53,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 151 treesize of output 137 [2018-04-11 16:15:53,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 108 [2018-04-11 16:15:53,466 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 16:15:53,538 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:15:53,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 84 [2018-04-11 16:15:53,539 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:53,541 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:15:53,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 92 [2018-04-11 16:15:53,541 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:53,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 111 [2018-04-11 16:15:53,609 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:15:53,665 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:15:53,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 95 [2018-04-11 16:15:53,666 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:53,726 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 85 treesize of output 78 [2018-04-11 16:15:53,726 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:53,772 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-11 16:15:53,840 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 116 treesize of output 114 [2018-04-11 16:15:53,842 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 7 treesize of output 1 [2018-04-11 16:15:53,842 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:53,856 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:15:53,857 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 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 16:15:53,857 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:53,868 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:53,936 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 74 [2018-04-11 16:15:53,937 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 7 treesize of output 1 [2018-04-11 16:15:53,937 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:53,946 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:15:53,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2018-04-11 16:15:53,947 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:53,953 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:54,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 72 [2018-04-11 16:15:54,021 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:15:54,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 16:15:54,021 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:54,040 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 7 treesize of output 1 [2018-04-11 16:15:54,040 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:54,050 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:54,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 76 [2018-04-11 16:15:54,053 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:15:54,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 16:15:54,053 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:54,065 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 7 treesize of output 1 [2018-04-11 16:15:54,065 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:54,075 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:54,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 68 [2018-04-11 16:15:54,078 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 7 treesize of output 1 [2018-04-11 16:15:54,078 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:54,089 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:15:54,089 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 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 16:15:54,089 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:54,106 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:54,148 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 4 dim-2 vars, End of recursive call: 6 dim-0 vars, and 4 xjuncts. [2018-04-11 16:15:54,148 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 13 variables, input treesize:268, output treesize:124 [2018-04-11 16:15:54,222 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:15:54,223 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:15:54,223 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-11 16:15:54,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 16:15:54,223 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 16:15:54,223 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2018-04-11 16:15:54,223 INFO L87 Difference]: Start difference. First operand 196 states and 223 transitions. Second operand 22 states. [2018-04-11 16:15:56,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:15:56,260 INFO L93 Difference]: Finished difference Result 310 states and 342 transitions. [2018-04-11 16:15:56,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 16:15:56,260 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 50 [2018-04-11 16:15:56,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:15:56,261 INFO L225 Difference]: With dead ends: 310 [2018-04-11 16:15:56,261 INFO L226 Difference]: Without dead ends: 310 [2018-04-11 16:15:56,261 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=295, Invalid=1597, Unknown=0, NotChecked=0, Total=1892 [2018-04-11 16:15:56,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-04-11 16:15:56,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 194. [2018-04-11 16:15:56,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-04-11 16:15:56,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 220 transitions. [2018-04-11 16:15:56,263 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 220 transitions. Word has length 50 [2018-04-11 16:15:56,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:15:56,263 INFO L459 AbstractCegarLoop]: Abstraction has 194 states and 220 transitions. [2018-04-11 16:15:56,263 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 16:15:56,263 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 220 transitions. [2018-04-11 16:15:56,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-11 16:15:56,263 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:15:56,264 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:15:56,264 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 16:15:56,264 INFO L82 PathProgramCache]: Analyzing trace with hash -829914267, now seen corresponding path program 3 times [2018-04-11 16:15:56,264 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:15:56,264 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:15:56,264 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:15:56,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:15:56,264 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:15:56,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:15:56,270 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:15:56,272 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:15:56,272 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:15:56,272 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:15:56,272 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 16:15:56,289 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-04-11 16:15:56,289 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:15:56,291 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:15:56,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 16:15:56,294 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:56,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:56,296 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 16:15:56,313 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:15:56,314 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:15:56,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 16:15:56,314 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:56,321 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:56,321 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-04-11 16:15:56,363 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 13 treesize of output 10 [2018-04-11 16:15:56,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:15:56,364 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:56,365 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:56,370 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:56,371 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:36 [2018-04-11 16:15:56,404 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:15:56,404 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:15:56,405 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:15:56,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 32 [2018-04-11 16:15:56,405 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:56,410 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:56,411 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:40 [2018-04-11 16:15:56,433 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 13 treesize of output 16 [2018-04-11 16:15:56,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 16:15:56,434 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:56,435 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:56,445 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:15:56,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 59 [2018-04-11 16:15:56,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:15:56,450 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:56,455 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:56,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:56,462 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:68, output treesize:69 [2018-04-11 16:15:56,478 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2018-04-11 16:15:56,479 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 15 treesize of output 3 [2018-04-11 16:15:56,479 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:56,480 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:56,487 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 16:15:56,487 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:108, output treesize:81 [2018-04-11 16:15:56,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 74 [2018-04-11 16:15:56,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-11 16:15:56,536 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:56,540 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:56,546 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 16:15:56,546 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:98, output treesize:82 [2018-04-11 16:15:56,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 56 [2018-04-11 16:15:56,605 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:15:56,606 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 31 treesize of output 23 [2018-04-11 16:15:56,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:56,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2018-04-11 16:15:56,612 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:56,614 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:56,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:56,618 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:82, output treesize:5 [2018-04-11 16:15:56,654 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:15:56,654 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:15:56,654 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-11 16:15:56,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 16:15:56,655 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 16:15:56,655 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2018-04-11 16:15:56,655 INFO L87 Difference]: Start difference. First operand 194 states and 220 transitions. Second operand 20 states. [2018-04-11 16:15:57,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:15:57,733 INFO L93 Difference]: Finished difference Result 333 states and 369 transitions. [2018-04-11 16:15:57,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-11 16:15:57,733 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 50 [2018-04-11 16:15:57,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:15:57,735 INFO L225 Difference]: With dead ends: 333 [2018-04-11 16:15:57,736 INFO L226 Difference]: Without dead ends: 333 [2018-04-11 16:15:57,736 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=300, Invalid=1506, Unknown=0, NotChecked=0, Total=1806 [2018-04-11 16:15:57,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-04-11 16:15:57,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 219. [2018-04-11 16:15:57,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-04-11 16:15:57,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 251 transitions. [2018-04-11 16:15:57,740 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 251 transitions. Word has length 50 [2018-04-11 16:15:57,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:15:57,740 INFO L459 AbstractCegarLoop]: Abstraction has 219 states and 251 transitions. [2018-04-11 16:15:57,740 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 16:15:57,740 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 251 transitions. [2018-04-11 16:15:57,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-11 16:15:57,740 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:15:57,741 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:15:57,741 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 16:15:57,741 INFO L82 PathProgramCache]: Analyzing trace with hash -829914266, now seen corresponding path program 2 times [2018-04-11 16:15:57,741 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:15:57,741 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:15:57,742 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:15:57,742 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:15:57,742 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:15:57,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:15:57,751 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:15:57,759 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:15:57,760 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:15:57,760 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:15:57,760 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 16:15:57,783 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 16:15:57,783 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:15:57,786 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:15:57,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:15:57,796 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:57,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 16:15:57,801 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:57,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:57,805 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 16:15:57,839 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:15:57,839 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 16:15:57,840 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:57,851 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:15:57,852 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:15:57,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 16:15:57,852 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:57,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:57,860 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-04-11 16:15:57,888 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 13 treesize of output 10 [2018-04-11 16:15:57,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:15:57,890 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:57,892 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:57,908 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 13 treesize of output 10 [2018-04-11 16:15:57,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:15:57,911 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:57,912 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:57,925 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:57,925 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:62, output treesize:57 [2018-04-11 16:15:58,031 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:15:58,032 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:15:58,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 53 [2018-04-11 16:15:58,033 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:58,059 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:15:58,060 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:15:58,060 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:15:58,061 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:15:58,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 46 [2018-04-11 16:15:58,062 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:58,094 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:15:58,094 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:88, output treesize:95 [2018-04-11 16:15:58,168 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 0 case distinctions, treesize of input 27 treesize of output 22 [2018-04-11 16:15:58,168 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:58,201 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:15:58,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 45 [2018-04-11 16:15:58,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:15:58,207 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:58,214 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:58,236 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:15:58,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 30 [2018-04-11 16:15:58,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 16:15:58,241 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:58,246 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:58,271 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:15:58,271 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:123, output treesize:104 [2018-04-11 16:15:58,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 156 [2018-04-11 16:15:58,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 33 [2018-04-11 16:15:58,378 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:58,386 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:58,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 141 [2018-04-11 16:15:58,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 33 [2018-04-11 16:15:58,414 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:58,424 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:58,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 16:15:58,439 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:217, output treesize:185 [2018-04-11 16:15:58,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 167 treesize of output 121 [2018-04-11 16:15:58,528 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 17 treesize of output 1 [2018-04-11 16:15:58,528 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:58,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 37 [2018-04-11 16:15:58,537 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:15:58,545 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:15:58,546 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 65 treesize of output 45 [2018-04-11 16:15:58,546 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:58,552 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:15:58,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 45 [2018-04-11 16:15:58,569 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:15:58,569 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 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 16:15:58,569 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:58,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-04-11 16:15:58,577 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:58,581 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 7 treesize of output 1 [2018-04-11 16:15:58,582 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 16:15:58,583 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:15:58,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 16:15:58,606 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:206, output treesize:36 [2018-04-11 16:15:58,671 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:15:58,671 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:15:58,671 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-11 16:15:58,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 16:15:58,671 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 16:15:58,672 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-04-11 16:15:58,672 INFO L87 Difference]: Start difference. First operand 219 states and 251 transitions. Second operand 22 states. [2018-04-11 16:16:00,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:16:00,959 INFO L93 Difference]: Finished difference Result 332 states and 371 transitions. [2018-04-11 16:16:00,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-11 16:16:00,959 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 50 [2018-04-11 16:16:00,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:16:00,960 INFO L225 Difference]: With dead ends: 332 [2018-04-11 16:16:00,960 INFO L226 Difference]: Without dead ends: 332 [2018-04-11 16:16:00,960 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=282, Invalid=1524, Unknown=0, NotChecked=0, Total=1806 [2018-04-11 16:16:00,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-04-11 16:16:00,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 205. [2018-04-11 16:16:00,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-04-11 16:16:00,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 233 transitions. [2018-04-11 16:16:00,965 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 233 transitions. Word has length 50 [2018-04-11 16:16:00,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:16:00,965 INFO L459 AbstractCegarLoop]: Abstraction has 205 states and 233 transitions. [2018-04-11 16:16:00,965 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 16:16:00,965 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 233 transitions. [2018-04-11 16:16:00,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-11 16:16:00,966 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:16:00,966 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:16:00,966 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 16:16:00,966 INFO L82 PathProgramCache]: Analyzing trace with hash -606899218, now seen corresponding path program 1 times [2018-04-11 16:16:00,966 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:16:00,966 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:16:00,967 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:16:00,967 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:16:00,967 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:16:00,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:16:00,975 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:16:00,979 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:16:00,979 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:16:00,979 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:16:00,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:16:00,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:16:01,001 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:16:01,023 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:01,023 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:01,024 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:01,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2018-04-11 16:16:01,025 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:01,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:01,029 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-04-11 16:16:01,046 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 13 treesize of output 10 [2018-04-11 16:16:01,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:16:01,047 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:01,048 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:01,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:01,054 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:36 [2018-04-11 16:16:01,102 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2018-04-11 16:16:01,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 16:16:01,105 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:01,116 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:01,122 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 16:16:01,123 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:48 [2018-04-11 16:16:01,153 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2018-04-11 16:16:01,155 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 7 treesize of output 1 [2018-04-11 16:16:01,155 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:01,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 22 [2018-04-11 16:16:01,162 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 16:16:01,168 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 16:16:01,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 16:16:01,177 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:57, output treesize:40 [2018-04-11 16:16:01,256 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:01,256 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:01,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2018-04-11 16:16:01,257 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:01,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:16:01,261 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2018-04-11 16:16:01,309 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 16:16:01,309 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:16:01,309 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-11 16:16:01,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 16:16:01,309 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 16:16:01,310 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-04-11 16:16:01,310 INFO L87 Difference]: Start difference. First operand 205 states and 233 transitions. Second operand 18 states. [2018-04-11 16:16:02,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:16:02,231 INFO L93 Difference]: Finished difference Result 265 states and 295 transitions. [2018-04-11 16:16:02,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 16:16:02,231 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 52 [2018-04-11 16:16:02,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:16:02,232 INFO L225 Difference]: With dead ends: 265 [2018-04-11 16:16:02,232 INFO L226 Difference]: Without dead ends: 265 [2018-04-11 16:16:02,232 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=229, Invalid=1031, Unknown=0, NotChecked=0, Total=1260 [2018-04-11 16:16:02,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-04-11 16:16:02,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 222. [2018-04-11 16:16:02,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-04-11 16:16:02,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 251 transitions. [2018-04-11 16:16:02,235 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 251 transitions. Word has length 52 [2018-04-11 16:16:02,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:16:02,236 INFO L459 AbstractCegarLoop]: Abstraction has 222 states and 251 transitions. [2018-04-11 16:16:02,236 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 16:16:02,236 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 251 transitions. [2018-04-11 16:16:02,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-11 16:16:02,236 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:16:02,237 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:16:02,237 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 16:16:02,237 INFO L82 PathProgramCache]: Analyzing trace with hash -606899217, now seen corresponding path program 1 times [2018-04-11 16:16:02,237 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:16:02,237 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:16:02,238 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:16:02,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:16:02,238 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:16:02,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:16:02,245 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:16:02,249 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:16:02,249 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:16:02,249 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:16:02,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:16:02,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:16:02,269 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:16:02,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:16:02,271 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:02,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:02,274 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 16:16:02,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 16:16:02,329 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:02,340 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:02,340 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:02,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 16:16:02,341 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:02,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:02,348 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-04-11 16:16:02,371 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 13 treesize of output 10 [2018-04-11 16:16:02,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 9 [2018-04-11 16:16:02,373 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:02,376 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:02,385 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 13 treesize of output 10 [2018-04-11 16:16:02,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:16:02,387 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:02,388 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:02,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:02,397 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2018-04-11 16:16:02,452 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 44 treesize of output 45 [2018-04-11 16:16:02,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 16:16:02,454 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:02,459 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:02,474 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 56 [2018-04-11 16:16:02,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 16:16:02,476 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:02,482 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:02,500 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 16:16:02,500 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:99, output treesize:79 [2018-04-11 16:16:02,591 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 52 [2018-04-11 16:16:02,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 31 [2018-04-11 16:16:02,598 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 16:16:02,613 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 7 treesize of output 1 [2018-04-11 16:16:02,613 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:02,623 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 16:16:02,650 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 54 treesize of output 46 [2018-04-11 16:16:02,651 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 7 treesize of output 1 [2018-04-11 16:16:02,652 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:02,659 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:02,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2018-04-11 16:16:02,660 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:02,667 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:02,669 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 46 treesize of output 38 [2018-04-11 16:16:02,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-11 16:16:02,671 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:02,680 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 19 [2018-04-11 16:16:02,681 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-04-11 16:16:02,688 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 16:16:02,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-04-11 16:16:02,705 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:97, output treesize:43 [2018-04-11 16:16:02,801 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 16:16:02,801 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:16:02,801 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-11 16:16:02,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 16:16:02,802 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 16:16:02,802 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2018-04-11 16:16:02,802 INFO L87 Difference]: Start difference. First operand 222 states and 251 transitions. Second operand 18 states. [2018-04-11 16:16:03,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:16:03,815 INFO L93 Difference]: Finished difference Result 281 states and 311 transitions. [2018-04-11 16:16:03,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-11 16:16:03,816 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 52 [2018-04-11 16:16:03,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:16:03,817 INFO L225 Difference]: With dead ends: 281 [2018-04-11 16:16:03,817 INFO L226 Difference]: Without dead ends: 281 [2018-04-11 16:16:03,817 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=231, Invalid=1175, Unknown=0, NotChecked=0, Total=1406 [2018-04-11 16:16:03,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-04-11 16:16:03,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 220. [2018-04-11 16:16:03,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-04-11 16:16:03,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 248 transitions. [2018-04-11 16:16:03,821 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 248 transitions. Word has length 52 [2018-04-11 16:16:03,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:16:03,821 INFO L459 AbstractCegarLoop]: Abstraction has 220 states and 248 transitions. [2018-04-11 16:16:03,822 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 16:16:03,822 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 248 transitions. [2018-04-11 16:16:03,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-11 16:16:03,822 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:16:03,822 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:16:03,822 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 16:16:03,823 INFO L82 PathProgramCache]: Analyzing trace with hash -644293180, now seen corresponding path program 1 times [2018-04-11 16:16:03,823 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:16:03,823 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:16:03,823 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:16:03,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:16:03,824 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:16:03,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:16:03,830 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:16:03,834 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:16:03,835 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:16:03,835 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:16:03,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:16:03,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:16:03,855 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:16:03,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:16:03,858 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:03,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:03,862 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 16:16:03,899 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:03,900 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:03,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 16:16:03,901 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:03,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:03,918 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-04-11 16:16:03,939 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 13 treesize of output 10 [2018-04-11 16:16:03,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:16:03,941 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:03,950 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:03,956 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:03,957 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:36 [2018-04-11 16:16:04,007 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2018-04-11 16:16:04,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 16:16:04,009 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:04,014 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:04,019 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 16:16:04,019 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:48 [2018-04-11 16:16:04,052 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2018-04-11 16:16:04,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 22 [2018-04-11 16:16:04,057 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 16:16:04,066 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 7 treesize of output 1 [2018-04-11 16:16:04,066 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:04,071 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 16:16:04,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 16:16:04,080 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:57, output treesize:40 [2018-04-11 16:16:04,135 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:04,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-04-11 16:16:04,135 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:04,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:16:04,138 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2018-04-11 16:16:04,170 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 16:16:04,170 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:16:04,170 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-11 16:16:04,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 16:16:04,170 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 16:16:04,170 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-04-11 16:16:04,170 INFO L87 Difference]: Start difference. First operand 220 states and 248 transitions. Second operand 18 states. [2018-04-11 16:16:05,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:16:05,011 INFO L93 Difference]: Finished difference Result 274 states and 306 transitions. [2018-04-11 16:16:05,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 16:16:05,012 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 52 [2018-04-11 16:16:05,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:16:05,012 INFO L225 Difference]: With dead ends: 274 [2018-04-11 16:16:05,012 INFO L226 Difference]: Without dead ends: 274 [2018-04-11 16:16:05,013 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=211, Invalid=911, Unknown=0, NotChecked=0, Total=1122 [2018-04-11 16:16:05,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-04-11 16:16:05,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 228. [2018-04-11 16:16:05,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-04-11 16:16:05,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 257 transitions. [2018-04-11 16:16:05,015 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 257 transitions. Word has length 52 [2018-04-11 16:16:05,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:16:05,015 INFO L459 AbstractCegarLoop]: Abstraction has 228 states and 257 transitions. [2018-04-11 16:16:05,015 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 16:16:05,015 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 257 transitions. [2018-04-11 16:16:05,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-11 16:16:05,016 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:16:05,016 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:16:05,016 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 16:16:05,016 INFO L82 PathProgramCache]: Analyzing trace with hash -644293179, now seen corresponding path program 1 times [2018-04-11 16:16:05,016 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:16:05,016 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:16:05,017 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:16:05,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:16:05,017 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:16:05,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:16:05,024 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:16:05,027 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:16:05,027 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:16:05,028 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:16:05,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:16:05,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:16:05,046 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:16:05,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:16:05,064 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:05,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:05,067 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 16:16:05,093 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:05,094 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:05,095 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 16:16:05,095 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:05,101 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:05,101 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-04-11 16:16:05,127 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 13 treesize of output 10 [2018-04-11 16:16:05,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:16:05,129 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:05,131 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:05,141 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 13 treesize of output 10 [2018-04-11 16:16:05,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 9 [2018-04-11 16:16:05,143 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:05,145 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:05,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:05,153 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:29 [2018-04-11 16:16:05,198 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 68 [2018-04-11 16:16:05,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 16:16:05,200 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:05,205 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:05,216 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 35 treesize of output 36 [2018-04-11 16:16:05,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 16:16:05,217 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:05,220 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:05,228 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 16:16:05,228 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:92, output treesize:72 [2018-04-11 16:16:05,270 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 54 [2018-04-11 16:16:05,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 33 [2018-04-11 16:16:05,275 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 16:16:05,286 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 7 treesize of output 1 [2018-04-11 16:16:05,286 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:05,294 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 16:16:05,311 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 39 treesize of output 33 [2018-04-11 16:16:05,313 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 7 treesize of output 1 [2018-04-11 16:16:05,314 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:05,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-11 16:16:05,325 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-11 16:16:05,330 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 16:16:05,332 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 47 treesize of output 41 [2018-04-11 16:16:05,333 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:05,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-04-11 16:16:05,334 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:05,338 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 7 treesize of output 1 [2018-04-11 16:16:05,338 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:05,341 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:05,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-04-11 16:16:05,355 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:90, output treesize:40 [2018-04-11 16:16:05,430 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 16:16:05,431 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:16:05,431 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-11 16:16:05,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 16:16:05,431 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 16:16:05,431 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2018-04-11 16:16:05,431 INFO L87 Difference]: Start difference. First operand 228 states and 257 transitions. Second operand 18 states. [2018-04-11 16:16:06,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:16:06,511 INFO L93 Difference]: Finished difference Result 294 states and 325 transitions. [2018-04-11 16:16:06,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 16:16:06,511 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 52 [2018-04-11 16:16:06,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:16:06,512 INFO L225 Difference]: With dead ends: 294 [2018-04-11 16:16:06,512 INFO L226 Difference]: Without dead ends: 294 [2018-04-11 16:16:06,512 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=259, Invalid=1301, Unknown=0, NotChecked=0, Total=1560 [2018-04-11 16:16:06,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-04-11 16:16:06,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 211. [2018-04-11 16:16:06,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-04-11 16:16:06,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 239 transitions. [2018-04-11 16:16:06,514 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 239 transitions. Word has length 52 [2018-04-11 16:16:06,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:16:06,514 INFO L459 AbstractCegarLoop]: Abstraction has 211 states and 239 transitions. [2018-04-11 16:16:06,514 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 16:16:06,515 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 239 transitions. [2018-04-11 16:16:06,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-11 16:16:06,515 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:16:06,515 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:16:06,515 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 16:16:06,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1749940967, now seen corresponding path program 3 times [2018-04-11 16:16:06,515 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:16:06,515 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:16:06,516 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:16:06,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:16:06,516 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:16:06,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:16:06,521 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:16:06,523 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:16:06,523 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:16:06,523 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:16:06,523 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 16:16:06,538 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-04-11 16:16:06,538 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:16:06,541 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:16:06,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 16:16:06,542 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:06,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:06,545 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 16:16:06,591 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:06,592 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:06,593 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 16:16:06,593 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:06,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:06,599 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-04-11 16:16:06,618 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 13 treesize of output 10 [2018-04-11 16:16:06,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:16:06,619 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:06,620 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:06,627 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:06,627 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2018-04-11 16:16:06,677 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:06,678 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:06,678 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 16:16:06,678 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:06,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:16:06,686 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2018-04-11 16:16:06,751 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 13 treesize of output 16 [2018-04-11 16:16:06,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 16:16:06,753 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:06,754 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:06,766 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:06,769 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 48 treesize of output 49 [2018-04-11 16:16:06,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 9 [2018-04-11 16:16:06,770 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:06,776 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:06,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:16:06,785 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:60, output treesize:49 [2018-04-11 16:16:06,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2018-04-11 16:16:06,806 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 15 treesize of output 3 [2018-04-11 16:16:06,806 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:06,807 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:06,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:16:06,814 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:34 [2018-04-11 16:16:06,852 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 11 treesize of output 8 [2018-04-11 16:16:06,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 16:16:06,853 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:06,855 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:06,863 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 16:16:06,863 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:41 [2018-04-11 16:16:06,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 43 [2018-04-11 16:16:06,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-04-11 16:16:06,901 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:06,916 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:16:06,917 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2018-04-11 16:16:06,918 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:16:06,927 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 16:16:06,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-04-11 16:16:06,941 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:49, output treesize:81 [2018-04-11 16:16:07,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 56 [2018-04-11 16:16:07,059 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 47 treesize of output 42 [2018-04-11 16:16:07,059 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:07,077 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 0 case distinctions, treesize of input 48 treesize of output 41 [2018-04-11 16:16:07,078 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:07,094 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 16:16:07,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2018-04-11 16:16:07,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-11 16:16:07,121 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:07,127 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:07,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-04-11 16:16:07,152 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:95, output treesize:115 [2018-04-11 16:16:07,234 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 36 treesize of output 32 [2018-04-11 16:16:07,235 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:16:07,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-04-11 16:16:07,235 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:07,238 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:07,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:07,242 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:46, output treesize:5 [2018-04-11 16:16:07,281 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:16:07,281 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:16:07,281 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-11 16:16:07,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-11 16:16:07,281 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-11 16:16:07,281 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2018-04-11 16:16:07,282 INFO L87 Difference]: Start difference. First operand 211 states and 239 transitions. Second operand 24 states. [2018-04-11 16:16:08,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:16:08,992 INFO L93 Difference]: Finished difference Result 313 states and 346 transitions. [2018-04-11 16:16:08,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-11 16:16:08,992 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 53 [2018-04-11 16:16:08,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:16:08,993 INFO L225 Difference]: With dead ends: 313 [2018-04-11 16:16:08,993 INFO L226 Difference]: Without dead ends: 313 [2018-04-11 16:16:08,994 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=416, Invalid=2340, Unknown=0, NotChecked=0, Total=2756 [2018-04-11 16:16:08,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-04-11 16:16:08,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 216. [2018-04-11 16:16:08,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-04-11 16:16:08,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 245 transitions. [2018-04-11 16:16:08,996 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 245 transitions. Word has length 53 [2018-04-11 16:16:08,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:16:08,996 INFO L459 AbstractCegarLoop]: Abstraction has 216 states and 245 transitions. [2018-04-11 16:16:08,996 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-11 16:16:08,996 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 245 transitions. [2018-04-11 16:16:08,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-11 16:16:08,996 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:16:08,996 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:16:08,996 INFO L408 AbstractCegarLoop]: === Iteration 33 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 16:16:08,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1749940968, now seen corresponding path program 2 times [2018-04-11 16:16:08,997 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:16:08,997 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:16:08,997 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:16:08,997 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:16:08,997 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:16:09,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:16:09,003 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:16:09,008 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:16:09,008 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:16:09,008 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:16:09,008 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 16:16:09,025 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 16:16:09,025 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:16:09,027 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:16:09,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:16:09,028 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:09,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:09,029 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 16:16:09,045 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:09,045 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 16:16:09,046 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:09,056 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:09,056 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:09,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 16:16:09,072 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:09,082 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:09,082 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:34 [2018-04-11 16:16:09,136 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 13 treesize of output 10 [2018-04-11 16:16:09,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:16:09,139 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:09,141 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:09,161 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 13 treesize of output 10 [2018-04-11 16:16:09,163 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:16:09,163 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:09,165 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:09,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:09,178 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:64, output treesize:65 [2018-04-11 16:16:09,218 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:09,218 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:09,219 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:09,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-04-11 16:16:09,220 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:09,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 53 [2018-04-11 16:16:09,233 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:09,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:16:09,243 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:85, output treesize:77 [2018-04-11 16:16:09,279 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:09,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 30 [2018-04-11 16:16:09,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 16:16:09,283 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:09,287 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:09,300 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:09,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 70 [2018-04-11 16:16:09,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:16:09,304 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:09,310 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:09,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:16:09,322 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:100, output treesize:107 [2018-04-11 16:16:09,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 156 [2018-04-11 16:16:09,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-04-11 16:16:09,398 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:09,405 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:09,425 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 141 [2018-04-11 16:16:09,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-04-11 16:16:09,427 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:09,436 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:09,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 16:16:09,449 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:214, output treesize:182 [2018-04-11 16:16:09,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 167 treesize of output 121 [2018-04-11 16:16:09,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 37 [2018-04-11 16:16:09,531 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:16:09,540 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:16:09,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 58 [2018-04-11 16:16:09,541 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:09,550 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 13 treesize of output 1 [2018-04-11 16:16:09,550 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:09,556 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:16:09,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 45 [2018-04-11 16:16:09,574 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 19 treesize of output 5 [2018-04-11 16:16:09,574 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:09,580 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:16:09,580 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 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 16:16:09,580 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:09,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 16:16:09,584 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:09,585 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:09,595 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 16:16:09,595 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:210, output treesize:36 [2018-04-11 16:16:09,645 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:16:09,645 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:16:09,645 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-11 16:16:09,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-11 16:16:09,646 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-11 16:16:09,646 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2018-04-11 16:16:09,646 INFO L87 Difference]: Start difference. First operand 216 states and 245 transitions. Second operand 21 states. [2018-04-11 16:16:11,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:16:11,772 INFO L93 Difference]: Finished difference Result 315 states and 348 transitions. [2018-04-11 16:16:11,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-11 16:16:11,772 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 53 [2018-04-11 16:16:11,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:16:11,773 INFO L225 Difference]: With dead ends: 315 [2018-04-11 16:16:11,773 INFO L226 Difference]: Without dead ends: 315 [2018-04-11 16:16:11,774 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=270, Invalid=1370, Unknown=0, NotChecked=0, Total=1640 [2018-04-11 16:16:11,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-04-11 16:16:11,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 216. [2018-04-11 16:16:11,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-04-11 16:16:11,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 245 transitions. [2018-04-11 16:16:11,776 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 245 transitions. Word has length 53 [2018-04-11 16:16:11,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:16:11,776 INFO L459 AbstractCegarLoop]: Abstraction has 216 states and 245 transitions. [2018-04-11 16:16:11,776 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-11 16:16:11,776 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 245 transitions. [2018-04-11 16:16:11,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-11 16:16:11,776 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:16:11,776 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:16:11,776 INFO L408 AbstractCegarLoop]: === Iteration 34 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 16:16:11,777 INFO L82 PathProgramCache]: Analyzing trace with hash 590728145, now seen corresponding path program 1 times [2018-04-11 16:16:11,777 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:16:11,777 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:16:11,777 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:16:11,777 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:16:11,777 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:16:11,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:16:11,782 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:16:11,785 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:16:11,785 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:16:11,785 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:16:11,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:16:11,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:16:11,799 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:16:11,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:16:11,820 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:11,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:16:11,824 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:11,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:11,827 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:11 [2018-04-11 16:16:11,844 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 11 treesize of output 8 [2018-04-11 16:16:11,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 16:16:11,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:11,847 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:11,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:11,854 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:24 [2018-04-11 16:16:11,867 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:11,868 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:11,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-11 16:16:11,869 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:11,880 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 16:16:11,881 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:11,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:11,892 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:38 [2018-04-11 16:16:11,924 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 13 treesize of output 10 [2018-04-11 16:16:11,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:16:11,925 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:11,927 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:11,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:11,938 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:63 [2018-04-11 16:16:11,982 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:11,984 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 19 treesize of output 26 [2018-04-11 16:16:11,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 16:16:11,985 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:11,989 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:11,998 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 16:16:11,998 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:80, output treesize:82 [2018-04-11 16:16:12,014 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:12,014 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:12,015 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:12,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 32 [2018-04-11 16:16:12,015 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:12,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 53 [2018-04-11 16:16:12,031 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:12,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:16:12,043 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:93, output treesize:85 [2018-04-11 16:16:12,079 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:12,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 68 [2018-04-11 16:16:12,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:16:12,083 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:12,091 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:12,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:16:12,102 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:98, output treesize:103 [2018-04-11 16:16:12,120 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 72 [2018-04-11 16:16:12,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 18 [2018-04-11 16:16:12,122 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:12,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2018-04-11 16:16:12,129 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:16:12,134 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:16:12,148 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 16:16:12,148 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:127, output treesize:52 [2018-04-11 16:16:12,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2018-04-11 16:16:12,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 16:16:12,199 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:12,204 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:12,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-04-11 16:16:12,214 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:63, output treesize:59 [2018-04-11 16:16:12,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2018-04-11 16:16:12,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 16:16:12,299 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:12,307 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 12 [2018-04-11 16:16:12,308 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 16:16:12,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 16:16:12,324 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:12,326 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 16:16:12,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-04-11 16:16:12,335 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:69, output treesize:94 [2018-04-11 16:16:12,428 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:16:12,429 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:16:12,429 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-11 16:16:12,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 16:16:12,429 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 16:16:12,429 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2018-04-11 16:16:12,430 INFO L87 Difference]: Start difference. First operand 216 states and 245 transitions. Second operand 22 states. [2018-04-11 16:16:13,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:16:13,970 INFO L93 Difference]: Finished difference Result 338 states and 378 transitions. [2018-04-11 16:16:13,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 16:16:13,970 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 53 [2018-04-11 16:16:13,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:16:13,971 INFO L225 Difference]: With dead ends: 338 [2018-04-11 16:16:13,971 INFO L226 Difference]: Without dead ends: 337 [2018-04-11 16:16:13,971 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=292, Invalid=1600, Unknown=0, NotChecked=0, Total=1892 [2018-04-11 16:16:13,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-04-11 16:16:13,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 229. [2018-04-11 16:16:13,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-04-11 16:16:13,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 261 transitions. [2018-04-11 16:16:13,977 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 261 transitions. Word has length 53 [2018-04-11 16:16:13,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:16:13,978 INFO L459 AbstractCegarLoop]: Abstraction has 229 states and 261 transitions. [2018-04-11 16:16:13,978 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 16:16:13,978 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 261 transitions. [2018-04-11 16:16:13,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-11 16:16:13,978 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:16:13,978 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:16:13,978 INFO L408 AbstractCegarLoop]: === Iteration 35 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 16:16:13,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1681430233, now seen corresponding path program 2 times [2018-04-11 16:16:13,978 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:16:13,978 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:16:13,979 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:16:13,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:16:13,979 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:16:13,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:16:13,984 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:16:13,989 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:16:13,989 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:16:13,989 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:16:13,989 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 16:16:14,003 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 16:16:14,004 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:16:14,007 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:16:14,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:16:14,010 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:14,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:16:14,014 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:14,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:14,017 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:11 [2018-04-11 16:16:14,037 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 11 treesize of output 8 [2018-04-11 16:16:14,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 16:16:14,038 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:14,040 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:14,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:14,048 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:24 [2018-04-11 16:16:14,062 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:14,063 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 16:16:14,063 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:14,077 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:14,078 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:14,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-11 16:16:14,079 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:14,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:14,090 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:38 [2018-04-11 16:16:14,134 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 13 treesize of output 10 [2018-04-11 16:16:14,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:16:14,136 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:14,138 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:14,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:14,152 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:63 [2018-04-11 16:16:14,195 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:14,197 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 19 treesize of output 26 [2018-04-11 16:16:14,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 16:16:14,199 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:14,203 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:14,213 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 16:16:14,213 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:80, output treesize:82 [2018-04-11 16:16:14,228 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:14,228 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:14,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 53 [2018-04-11 16:16:14,229 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:14,244 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:14,245 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:14,245 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:14,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 32 [2018-04-11 16:16:14,246 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:14,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:16:14,257 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:93, output treesize:85 [2018-04-11 16:16:14,290 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:14,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 68 [2018-04-11 16:16:14,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:16:14,294 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:14,302 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:14,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:16:14,314 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:98, output treesize:103 [2018-04-11 16:16:14,333 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 72 [2018-04-11 16:16:14,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2018-04-11 16:16:14,335 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:16:14,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 14 [2018-04-11 16:16:14,351 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:14,356 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:16:14,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 16:16:14,366 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:127, output treesize:52 [2018-04-11 16:16:14,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2018-04-11 16:16:14,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 16:16:14,432 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:14,438 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:14,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-04-11 16:16:14,449 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:63, output treesize:59 [2018-04-11 16:16:14,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2018-04-11 16:16:14,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 16:16:14,572 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:14,582 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 12 [2018-04-11 16:16:14,582 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 16:16:14,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 16:16:14,587 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:14,589 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 16:16:14,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-04-11 16:16:14,600 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:69, output treesize:94 [2018-04-11 16:16:14,697 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:16:14,697 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:16:14,697 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-11 16:16:14,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 16:16:14,698 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 16:16:14,698 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2018-04-11 16:16:14,698 INFO L87 Difference]: Start difference. First operand 229 states and 261 transitions. Second operand 22 states. [2018-04-11 16:16:16,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:16:16,101 INFO L93 Difference]: Finished difference Result 348 states and 388 transitions. [2018-04-11 16:16:16,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 16:16:16,101 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 53 [2018-04-11 16:16:16,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:16:16,102 INFO L225 Difference]: With dead ends: 348 [2018-04-11 16:16:16,102 INFO L226 Difference]: Without dead ends: 347 [2018-04-11 16:16:16,103 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=292, Invalid=1600, Unknown=0, NotChecked=0, Total=1892 [2018-04-11 16:16:16,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-04-11 16:16:16,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 219. [2018-04-11 16:16:16,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-04-11 16:16:16,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 248 transitions. [2018-04-11 16:16:16,105 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 248 transitions. Word has length 53 [2018-04-11 16:16:16,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:16:16,105 INFO L459 AbstractCegarLoop]: Abstraction has 219 states and 248 transitions. [2018-04-11 16:16:16,105 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 16:16:16,105 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 248 transitions. [2018-04-11 16:16:16,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-11 16:16:16,105 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:16:16,105 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:16:16,105 INFO L408 AbstractCegarLoop]: === Iteration 36 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 16:16:16,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1484123463, now seen corresponding path program 2 times [2018-04-11 16:16:16,105 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:16:16,105 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:16:16,106 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:16:16,106 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:16:16,106 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:16:16,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:16:16,111 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:16:16,113 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:16:16,113 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:16:16,113 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:16:16,114 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 16:16:16,128 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 16:16:16,128 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:16:16,130 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:16:16,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:16:16,134 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:16,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:16:16,137 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:16,139 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:16,139 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:11 [2018-04-11 16:16:16,160 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:16,160 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 16:16:16,160 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:16,166 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:16,167 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:16,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-11 16:16:16,168 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:16,171 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:16,171 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-04-11 16:16:16,187 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 13 treesize of output 10 [2018-04-11 16:16:16,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:16:16,189 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:16,190 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:16,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:16,199 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:45 [2018-04-11 16:16:16,266 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:16,267 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:16,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 53 [2018-04-11 16:16:16,268 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:16,288 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:16,289 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:16,289 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:16,290 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:16,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 46 [2018-04-11 16:16:16,290 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:16,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:16:16,308 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:79, output treesize:86 [2018-04-11 16:16:16,359 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:16,361 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:16,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 67 [2018-04-11 16:16:16,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-04-11 16:16:16,364 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:16,372 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:16,393 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 13 treesize of output 16 [2018-04-11 16:16:16,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 16:16:16,395 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:16,396 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:16,414 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:16:16,415 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:116, output treesize:119 [2018-04-11 16:16:16,448 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 31 treesize of output 15 [2018-04-11 16:16:16,449 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 15 treesize of output 3 [2018-04-11 16:16:16,449 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:16,451 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:16,468 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 16:16:16,468 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:176, output treesize:149 [2018-04-11 16:16:16,544 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:16,546 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:16,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 128 [2018-04-11 16:16:16,549 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-11 16:16:16,550 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:16,560 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:16,572 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 16:16:16,572 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:166, output treesize:150 [2018-04-11 16:16:16,757 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:16,757 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:16:16,758 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 0 case distinctions, treesize of input 74 treesize of output 76 [2018-04-11 16:16:16,758 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:16,789 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:16,790 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:16:16,817 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:16,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 88 [2018-04-11 16:16:16,821 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:16:16,826 INFO L477 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 41 [2018-04-11 16:16:16,827 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-11 16:16:16,844 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:16:16,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 44 [2018-04-11 16:16:16,850 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-11 16:16:16,876 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:16:16,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2018-04-11 16:16:16,877 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:16,892 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 16:16:16,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-04-11 16:16:16,912 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:191, output treesize:57 [2018-04-11 16:16:16,980 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 16:16:16,980 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:16:16,981 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-11 16:16:16,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-11 16:16:16,981 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-11 16:16:16,981 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=520, Unknown=0, NotChecked=0, Total=600 [2018-04-11 16:16:16,981 INFO L87 Difference]: Start difference. First operand 219 states and 248 transitions. Second operand 25 states. [2018-04-11 16:16:19,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:16:19,468 INFO L93 Difference]: Finished difference Result 324 states and 364 transitions. [2018-04-11 16:16:19,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-11 16:16:19,468 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 55 [2018-04-11 16:16:19,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:16:19,469 INFO L225 Difference]: With dead ends: 324 [2018-04-11 16:16:19,469 INFO L226 Difference]: Without dead ends: 324 [2018-04-11 16:16:19,470 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 517 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=369, Invalid=2081, Unknown=0, NotChecked=0, Total=2450 [2018-04-11 16:16:19,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-04-11 16:16:19,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 238. [2018-04-11 16:16:19,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-04-11 16:16:19,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 272 transitions. [2018-04-11 16:16:19,472 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 272 transitions. Word has length 55 [2018-04-11 16:16:19,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:16:19,472 INFO L459 AbstractCegarLoop]: Abstraction has 238 states and 272 transitions. [2018-04-11 16:16:19,472 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-11 16:16:19,472 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 272 transitions. [2018-04-11 16:16:19,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-11 16:16:19,473 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:16:19,473 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:16:19,473 INFO L408 AbstractCegarLoop]: === Iteration 37 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 16:16:19,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1484123462, now seen corresponding path program 2 times [2018-04-11 16:16:19,473 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:16:19,473 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:16:19,474 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:16:19,474 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:16:19,474 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:16:19,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:16:19,479 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:16:19,486 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:16:19,486 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:16:19,487 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:16:19,487 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 16:16:19,503 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 16:16:19,503 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:16:19,505 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:16:19,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:16:19,507 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:19,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:16:19,510 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:19,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:19,513 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 16:16:19,541 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:19,541 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:19,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-11 16:16:19,542 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:19,551 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 16:16:19,551 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:19,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:19,558 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-04-11 16:16:19,602 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 13 treesize of output 10 [2018-04-11 16:16:19,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:16:19,604 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:19,605 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:19,617 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 13 treesize of output 10 [2018-04-11 16:16:19,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 9 [2018-04-11 16:16:19,619 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:19,620 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:19,628 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:19,629 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:55, output treesize:50 [2018-04-11 16:16:19,693 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:19,693 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:19,694 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:19,694 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:19,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-11 16:16:19,695 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:19,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-04-11 16:16:19,707 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:19,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:16:19,718 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:78, output treesize:70 [2018-04-11 16:16:19,755 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:19,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 30 [2018-04-11 16:16:19,759 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 16:16:19,759 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:19,762 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:19,778 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:19,780 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:19,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 71 [2018-04-11 16:16:19,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-04-11 16:16:19,782 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:19,788 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:19,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:16:19,803 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:100, output treesize:97 [2018-04-11 16:16:19,904 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:19,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 156 [2018-04-11 16:16:19,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 33 [2018-04-11 16:16:19,910 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:19,917 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:19,934 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:19,937 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:19,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 177 treesize of output 162 [2018-04-11 16:16:19,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 33 [2018-04-11 16:16:19,940 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:19,951 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:19,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 16:16:19,966 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:216, output treesize:184 [2018-04-11 16:16:20,262 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:20,263 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:16:20,263 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:20,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 191 treesize of output 172 [2018-04-11 16:16:20,268 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:16:20,273 INFO L477 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 134 treesize of output 98 [2018-04-11 16:16:20,274 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-11 16:16:20,302 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 75 treesize of output 62 [2018-04-11 16:16:20,303 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:20,304 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 81 treesize of output 68 [2018-04-11 16:16:20,304 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:20,328 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:16:20,328 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 86 treesize of output 70 [2018-04-11 16:16:20,329 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:20,330 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:16:20,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 92 treesize of output 84 [2018-04-11 16:16:20,337 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-11 16:16:20,371 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 16:16:20,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 69 [2018-04-11 16:16:20,409 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:16:20,409 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 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 16:16:20,409 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:20,420 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:16:20,421 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 0 case distinctions, treesize of input 26 treesize of output 18 [2018-04-11 16:16:20,421 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:20,430 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 7 treesize of output 1 [2018-04-11 16:16:20,430 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:20,436 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:20,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 69 [2018-04-11 16:16:20,441 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:16:20,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-04-11 16:16:20,441 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:20,461 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:16:20,462 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 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 16:16:20,462 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:20,471 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 7 treesize of output 1 [2018-04-11 16:16:20,472 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:20,477 INFO L267 ElimStorePlain]: Start of recursive call 12: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:20,501 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-04-11 16:16:20,501 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 7 variables, input treesize:236, output treesize:83 [2018-04-11 16:16:20,656 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 16:16:20,656 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:16:20,656 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-11 16:16:20,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-11 16:16:20,657 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-11 16:16:20,657 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=544, Unknown=0, NotChecked=0, Total=600 [2018-04-11 16:16:20,657 INFO L87 Difference]: Start difference. First operand 238 states and 272 transitions. Second operand 25 states. [2018-04-11 16:16:34,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:16:34,032 INFO L93 Difference]: Finished difference Result 357 states and 399 transitions. [2018-04-11 16:16:34,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-11 16:16:34,032 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 55 [2018-04-11 16:16:34,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:16:34,033 INFO L225 Difference]: With dead ends: 357 [2018-04-11 16:16:34,033 INFO L226 Difference]: Without dead ends: 357 [2018-04-11 16:16:34,033 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=305, Invalid=1950, Unknown=1, NotChecked=0, Total=2256 [2018-04-11 16:16:34,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2018-04-11 16:16:34,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 234. [2018-04-11 16:16:34,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-04-11 16:16:34,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 267 transitions. [2018-04-11 16:16:34,037 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 267 transitions. Word has length 55 [2018-04-11 16:16:34,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:16:34,037 INFO L459 AbstractCegarLoop]: Abstraction has 234 states and 267 transitions. [2018-04-11 16:16:34,037 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-11 16:16:34,037 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 267 transitions. [2018-04-11 16:16:34,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-11 16:16:34,038 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:16:34,038 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:16:34,038 INFO L408 AbstractCegarLoop]: === Iteration 38 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 16:16:34,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1110028943, now seen corresponding path program 4 times [2018-04-11 16:16:34,038 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:16:34,038 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:16:34,039 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:16:34,039 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:16:34,039 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:16:34,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:16:34,048 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:16:34,067 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:16:34,068 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:16:34,068 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:16:34,068 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 16:16:34,092 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 16:16:34,092 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:16:34,095 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:16:34,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 16:16:34,097 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:34,100 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:34,100 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 16:16:34,124 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:34,124 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:34,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 16:16:34,125 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:34,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 16:16:34,136 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:34,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:34,146 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-04-11 16:16:34,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 16:16:34,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:16:34,172 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:34,172 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:34,179 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:34,179 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:47 [2018-04-11 16:16:34,228 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:34,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-11 16:16:34,229 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:34,239 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:34,240 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:34,240 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:34,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 58 [2018-04-11 16:16:34,241 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:34,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:34,251 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:70, output treesize:77 [2018-04-11 16:16:34,286 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:34,288 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:34,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 77 [2018-04-11 16:16:34,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-04-11 16:16:34,290 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:34,297 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:34,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:34,310 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:92 [2018-04-11 16:16:34,374 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:34,376 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:34,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 130 [2018-04-11 16:16:34,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-04-11 16:16:34,379 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:34,388 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:34,399 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 16:16:34,399 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:156, output treesize:140 [2018-04-11 16:16:34,541 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:16:34,541 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 0 case distinctions, treesize of input 49 treesize of output 38 [2018-04-11 16:16:34,541 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:34,556 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:16:34,556 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:34,557 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:34,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 82 [2018-04-11 16:16:34,561 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:16:34,564 INFO L477 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 39 [2018-04-11 16:16:34,565 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-11 16:16:34,578 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 7 treesize of output 1 [2018-04-11 16:16:34,578 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:34,589 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:16:34,590 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 42 treesize of output 30 [2018-04-11 16:16:34,590 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:34,592 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:16:34,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 44 [2018-04-11 16:16:34,596 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-11 16:16:34,609 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 16:16:34,623 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-04-11 16:16:34,623 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:156, output treesize:57 [2018-04-11 16:16:34,736 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:16:34,737 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:16:34,737 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-11 16:16:34,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-11 16:16:34,737 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-11 16:16:34,737 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2018-04-11 16:16:34,737 INFO L87 Difference]: Start difference. First operand 234 states and 267 transitions. Second operand 24 states. [2018-04-11 16:16:37,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:16:37,331 INFO L93 Difference]: Finished difference Result 347 states and 388 transitions. [2018-04-11 16:16:37,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 16:16:37,331 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 55 [2018-04-11 16:16:37,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:16:37,332 INFO L225 Difference]: With dead ends: 347 [2018-04-11 16:16:37,332 INFO L226 Difference]: Without dead ends: 347 [2018-04-11 16:16:37,332 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=328, Invalid=1834, Unknown=0, NotChecked=0, Total=2162 [2018-04-11 16:16:37,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-04-11 16:16:37,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 243. [2018-04-11 16:16:37,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-04-11 16:16:37,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 278 transitions. [2018-04-11 16:16:37,335 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 278 transitions. Word has length 55 [2018-04-11 16:16:37,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:16:37,335 INFO L459 AbstractCegarLoop]: Abstraction has 243 states and 278 transitions. [2018-04-11 16:16:37,335 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-11 16:16:37,335 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 278 transitions. [2018-04-11 16:16:37,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-11 16:16:37,336 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:16:37,336 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:16:37,336 INFO L408 AbstractCegarLoop]: === Iteration 39 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 16:16:37,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1110028944, now seen corresponding path program 3 times [2018-04-11 16:16:37,336 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:16:37,336 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:16:37,337 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:16:37,337 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:16:37,337 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:16:37,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:16:37,348 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:16:37,350 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:16:37,351 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:16:37,351 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:16:37,351 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 16:16:37,366 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-04-11 16:16:37,366 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:16:37,368 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:16:37,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 16:16:37,370 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:37,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:37,372 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 16:16:37,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:16:37,400 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:37,409 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:37,409 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:37,410 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 16:16:37,410 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:37,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:37,416 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:25 [2018-04-11 16:16:37,438 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 13 treesize of output 10 [2018-04-11 16:16:37,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:16:37,440 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:37,441 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:37,451 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 13 treesize of output 10 [2018-04-11 16:16:37,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:16:37,452 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:37,453 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:37,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:37,461 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:53, output treesize:48 [2018-04-11 16:16:37,518 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:37,518 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-11 16:16:37,518 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:37,535 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:37,536 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:37,536 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:37,537 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:37,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 49 [2018-04-11 16:16:37,537 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:37,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:16:37,553 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:82, output treesize:89 [2018-04-11 16:16:37,603 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 0 case distinctions, treesize of input 27 treesize of output 22 [2018-04-11 16:16:37,603 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:37,624 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:37,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 46 [2018-04-11 16:16:37,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-04-11 16:16:37,626 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:37,631 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:37,647 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:37,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 30 [2018-04-11 16:16:37,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 16:16:37,651 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:37,654 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:37,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:16:37,668 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:124, output treesize:95 [2018-04-11 16:16:37,759 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:37,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 156 [2018-04-11 16:16:37,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-04-11 16:16:37,765 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:37,773 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:37,792 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:37,794 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:37,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 177 treesize of output 162 [2018-04-11 16:16:37,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 33 [2018-04-11 16:16:37,798 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:37,809 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:37,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 16:16:37,824 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:214, output treesize:182 [2018-04-11 16:16:38,047 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:38,048 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:38,048 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:16:38,048 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:38,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 192 [2018-04-11 16:16:38,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 1 [2018-04-11 16:16:38,052 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:38,068 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:16:38,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 75 [2018-04-11 16:16:38,068 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:16:38,080 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:16:38,081 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 58 treesize of output 42 [2018-04-11 16:16:38,081 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:38,090 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:16:38,118 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 49 [2018-04-11 16:16:38,120 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:16:38,120 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 0 case distinctions, treesize of input 19 treesize of output 13 [2018-04-11 16:16:38,120 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:38,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-04-11 16:16:38,126 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:38,129 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:16:38,130 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 0 case distinctions, treesize of input 13 treesize of output 9 [2018-04-11 16:16:38,130 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:38,131 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:38,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:16:38,141 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:227, output treesize:23 [2018-04-11 16:16:38,205 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:16:38,205 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:16:38,205 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-11 16:16:38,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-11 16:16:38,205 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-11 16:16:38,205 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2018-04-11 16:16:38,206 INFO L87 Difference]: Start difference. First operand 243 states and 278 transitions. Second operand 24 states. [2018-04-11 16:16:41,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:16:41,380 INFO L93 Difference]: Finished difference Result 393 states and 437 transitions. [2018-04-11 16:16:41,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-11 16:16:41,381 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 55 [2018-04-11 16:16:41,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:16:41,382 INFO L225 Difference]: With dead ends: 393 [2018-04-11 16:16:41,382 INFO L226 Difference]: Without dead ends: 393 [2018-04-11 16:16:41,382 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 417 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=310, Invalid=1852, Unknown=0, NotChecked=0, Total=2162 [2018-04-11 16:16:41,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2018-04-11 16:16:41,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 224. [2018-04-11 16:16:41,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-04-11 16:16:41,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 254 transitions. [2018-04-11 16:16:41,384 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 254 transitions. Word has length 55 [2018-04-11 16:16:41,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:16:41,384 INFO L459 AbstractCegarLoop]: Abstraction has 224 states and 254 transitions. [2018-04-11 16:16:41,384 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-11 16:16:41,384 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 254 transitions. [2018-04-11 16:16:41,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-11 16:16:41,384 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:16:41,385 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, 1, 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 16:16:41,385 INFO L408 AbstractCegarLoop]: === Iteration 40 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 16:16:41,385 INFO L82 PathProgramCache]: Analyzing trace with hash -286721599, now seen corresponding path program 1 times [2018-04-11 16:16:41,385 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:16:41,385 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:16:41,385 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:16:41,385 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:16:41,385 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:16:41,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:16:41,389 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:16:41,392 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:16:41,392 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:16:41,392 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:16:41,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:16:41,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:16:41,403 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:16:41,435 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 11 treesize of output 8 [2018-04-11 16:16:41,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 16:16:41,437 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:41,438 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:41,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:41,443 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-04-11 16:16:41,453 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:41,454 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:41,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-11 16:16:41,455 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:41,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:41,460 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:24 [2018-04-11 16:16:41,482 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 13 treesize of output 10 [2018-04-11 16:16:41,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:16:41,483 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:41,484 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:41,491 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:41,491 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2018-04-11 16:16:41,502 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 16:16:41,503 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 16 treesize of output 4 [2018-04-11 16:16:41,503 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:41,504 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:41,508 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 16:16:41,508 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:21 [2018-04-11 16:16:41,525 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 16:16:41,526 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:41,532 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 19 treesize of output 20 [2018-04-11 16:16:41,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 16:16:41,534 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:41,536 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:41,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 16:16:41,540 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:37, output treesize:28 [2018-04-11 16:16:41,578 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 22 treesize of output 20 [2018-04-11 16:16:41,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 16:16:41,579 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:41,582 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:16:41,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-11 16:16:41,583 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:41,584 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:41,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:41,589 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:38, output treesize:3 [2018-04-11 16:16:41,599 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 16:16:41,599 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:16:41,599 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-11 16:16:41,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-11 16:16:41,600 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-11 16:16:41,600 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-04-11 16:16:41,600 INFO L87 Difference]: Start difference. First operand 224 states and 254 transitions. Second operand 15 states. [2018-04-11 16:16:42,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:16:42,007 INFO L93 Difference]: Finished difference Result 302 states and 334 transitions. [2018-04-11 16:16:42,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-11 16:16:42,007 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 58 [2018-04-11 16:16:42,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:16:42,008 INFO L225 Difference]: With dead ends: 302 [2018-04-11 16:16:42,008 INFO L226 Difference]: Without dead ends: 300 [2018-04-11 16:16:42,008 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=172, Invalid=584, Unknown=0, NotChecked=0, Total=756 [2018-04-11 16:16:42,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-04-11 16:16:42,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 224. [2018-04-11 16:16:42,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-04-11 16:16:42,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 253 transitions. [2018-04-11 16:16:42,010 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 253 transitions. Word has length 58 [2018-04-11 16:16:42,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:16:42,010 INFO L459 AbstractCegarLoop]: Abstraction has 224 states and 253 transitions. [2018-04-11 16:16:42,010 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-11 16:16:42,010 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 253 transitions. [2018-04-11 16:16:42,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-11 16:16:42,010 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:16:42,010 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:16:42,010 INFO L408 AbstractCegarLoop]: === Iteration 41 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 16:16:42,010 INFO L82 PathProgramCache]: Analyzing trace with hash -350140512, now seen corresponding path program 4 times [2018-04-11 16:16:42,010 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:16:42,010 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:16:42,011 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:16:42,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:16:42,011 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:16:42,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:16:42,017 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:16:42,019 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:16:42,019 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:16:42,019 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:16:42,020 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 16:16:42,041 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 16:16:42,041 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:16:42,043 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:16:42,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:16:42,060 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:42,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:42,063 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 16:16:42,078 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:42,079 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:42,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-11 16:16:42,080 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:42,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:42,086 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-04-11 16:16:42,107 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 13 treesize of output 10 [2018-04-11 16:16:42,109 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 9 [2018-04-11 16:16:42,109 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:42,110 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:42,120 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 13 treesize of output 10 [2018-04-11 16:16:42,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:16:42,121 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:42,123 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:42,131 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:42,131 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:45 [2018-04-11 16:16:42,179 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:42,180 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:42,180 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:42,181 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 61 [2018-04-11 16:16:42,181 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:42,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:42,189 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:68, output treesize:76 [2018-04-11 16:16:42,225 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:42,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-04-11 16:16:42,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 16:16:42,229 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:42,233 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:42,247 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:42,248 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:42,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 81 [2018-04-11 16:16:42,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-04-11 16:16:42,250 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:42,257 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:42,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:42,268 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:102, output treesize:84 [2018-04-11 16:16:42,324 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:42,328 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:42,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 183 treesize of output 156 [2018-04-11 16:16:42,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-04-11 16:16:42,332 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:42,341 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:42,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 141 [2018-04-11 16:16:42,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-04-11 16:16:42,358 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:42,365 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:42,378 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:16:42,379 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:200, output treesize:156 [2018-04-11 16:16:42,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 109 [2018-04-11 16:16:42,467 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 7 treesize of output 1 [2018-04-11 16:16:42,467 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:42,474 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:16:42,475 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 0 case distinctions, treesize of input 87 treesize of output 67 [2018-04-11 16:16:42,475 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:42,480 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:42,490 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 16:16:42,490 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:151, output treesize:91 [2018-04-11 16:16:42,563 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:42,563 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:42,564 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:16:42,564 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:42,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 82 [2018-04-11 16:16:42,569 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:16:42,572 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 37 [2018-04-11 16:16:42,572 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 16:16:42,584 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 7 treesize of output 1 [2018-04-11 16:16:42,584 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:42,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2018-04-11 16:16:42,589 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:16:42,593 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:16:42,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 16:16:42,601 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:100, output treesize:28 [2018-04-11 16:16:42,649 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:16:42,649 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:16:42,649 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-11 16:16:42,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 16:16:42,650 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 16:16:42,650 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2018-04-11 16:16:42,650 INFO L87 Difference]: Start difference. First operand 224 states and 253 transitions. Second operand 23 states. [2018-04-11 16:16:43,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:16:43,770 INFO L93 Difference]: Finished difference Result 298 states and 333 transitions. [2018-04-11 16:16:43,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-11 16:16:43,770 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 58 [2018-04-11 16:16:43,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:16:43,771 INFO L225 Difference]: With dead ends: 298 [2018-04-11 16:16:43,771 INFO L226 Difference]: Without dead ends: 298 [2018-04-11 16:16:43,772 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=291, Invalid=1601, Unknown=0, NotChecked=0, Total=1892 [2018-04-11 16:16:43,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-04-11 16:16:43,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 229. [2018-04-11 16:16:43,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-04-11 16:16:43,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 259 transitions. [2018-04-11 16:16:43,773 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 259 transitions. Word has length 58 [2018-04-11 16:16:43,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:16:43,773 INFO L459 AbstractCegarLoop]: Abstraction has 229 states and 259 transitions. [2018-04-11 16:16:43,773 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 16:16:43,773 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 259 transitions. [2018-04-11 16:16:43,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-11 16:16:43,774 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:16:43,774 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:16:43,774 INFO L408 AbstractCegarLoop]: === Iteration 42 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 16:16:43,774 INFO L82 PathProgramCache]: Analyzing trace with hash -350140511, now seen corresponding path program 3 times [2018-04-11 16:16:43,774 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:16:43,774 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:16:43,775 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:16:43,775 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:16:43,775 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:16:43,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:16:43,784 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:16:43,794 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:16:43,794 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:16:43,794 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:16:43,794 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 16:16:43,821 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-04-11 16:16:43,822 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:16:43,824 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:16:43,862 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:43,863 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:43,863 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 16:16:43,864 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:43,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 16:16:43,872 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:43,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:43,879 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-04-11 16:16:43,906 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 13 treesize of output 10 [2018-04-11 16:16:43,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:16:43,908 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:43,910 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:43,925 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 13 treesize of output 10 [2018-04-11 16:16:43,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 9 [2018-04-11 16:16:43,927 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:43,929 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:43,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:43,941 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:45 [2018-04-11 16:16:44,022 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:44,022 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:44,023 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:44,024 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:44,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-11 16:16:44,024 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:44,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-11 16:16:44,043 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:44,059 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:44,059 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:79, output treesize:71 [2018-04-11 16:16:44,115 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:44,117 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:44,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 56 [2018-04-11 16:16:44,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-04-11 16:16:44,119 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:44,125 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:44,140 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:44,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-04-11 16:16:44,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 16:16:44,144 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:44,149 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:44,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:44,162 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:94, output treesize:91 [2018-04-11 16:16:44,264 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:44,268 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:44,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 159 [2018-04-11 16:16:44,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 33 [2018-04-11 16:16:44,272 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:44,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:44,315 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:44,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 149 [2018-04-11 16:16:44,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 33 [2018-04-11 16:16:44,322 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:44,331 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:44,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:16:44,345 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:204, output treesize:172 [2018-04-11 16:16:44,509 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:44,510 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:44,511 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:44,511 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:16:44,514 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:44,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 189 treesize of output 182 [2018-04-11 16:16:44,534 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:16:44,541 INFO L477 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 140 treesize of output 108 [2018-04-11 16:16:44,542 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-11 16:16:44,586 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:16:44,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 110 treesize of output 108 [2018-04-11 16:16:44,593 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 16:16:44,595 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:16:44,596 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 104 treesize of output 88 [2018-04-11 16:16:44,596 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:44,654 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 75 treesize of output 62 [2018-04-11 16:16:44,654 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:44,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 62 [2018-04-11 16:16:44,656 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:44,676 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 16:16:44,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 62 [2018-04-11 16:16:44,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-04-11 16:16:44,706 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:44,714 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:16:44,715 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 0 case distinctions, treesize of input 22 treesize of output 14 [2018-04-11 16:16:44,715 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:44,722 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:16:44,722 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 0 case distinctions, treesize of input 13 treesize of output 9 [2018-04-11 16:16:44,722 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:44,728 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:44,730 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 62 [2018-04-11 16:16:44,732 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:16:44,732 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 0 case distinctions, treesize of input 30 treesize of output 22 [2018-04-11 16:16:44,732 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:44,741 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 7 treesize of output 1 [2018-04-11 16:16:44,741 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:44,748 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:16:44,749 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 0 case distinctions, treesize of input 17 treesize of output 9 [2018-04-11 16:16:44,749 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:44,754 INFO L267 ElimStorePlain]: Start of recursive call 12: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:44,769 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 16:16:44,769 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 5 variables, input treesize:212, output treesize:37 [2018-04-11 16:16:44,824 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:16:44,825 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:16:44,825 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-11 16:16:44,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-11 16:16:44,825 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-11 16:16:44,825 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552 [2018-04-11 16:16:44,825 INFO L87 Difference]: Start difference. First operand 229 states and 259 transitions. Second operand 24 states. [2018-04-11 16:16:46,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:16:46,253 INFO L93 Difference]: Finished difference Result 337 states and 371 transitions. [2018-04-11 16:16:46,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 16:16:46,253 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 58 [2018-04-11 16:16:46,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:16:46,254 INFO L225 Difference]: With dead ends: 337 [2018-04-11 16:16:46,254 INFO L226 Difference]: Without dead ends: 337 [2018-04-11 16:16:46,254 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=324, Invalid=1838, Unknown=0, NotChecked=0, Total=2162 [2018-04-11 16:16:46,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-04-11 16:16:46,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 229. [2018-04-11 16:16:46,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-04-11 16:16:46,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 259 transitions. [2018-04-11 16:16:46,256 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 259 transitions. Word has length 58 [2018-04-11 16:16:46,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:16:46,257 INFO L459 AbstractCegarLoop]: Abstraction has 229 states and 259 transitions. [2018-04-11 16:16:46,257 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-11 16:16:46,257 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 259 transitions. [2018-04-11 16:16:46,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-11 16:16:46,257 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:16:46,257 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, 1, 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 16:16:46,257 INFO L408 AbstractCegarLoop]: === Iteration 43 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 16:16:46,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1806773015, now seen corresponding path program 1 times [2018-04-11 16:16:46,258 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:16:46,258 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:16:46,258 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:16:46,258 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:16:46,258 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:16:46,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:16:46,265 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:16:46,268 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:16:46,268 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:16:46,268 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:16:46,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:16:46,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:16:46,286 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:16:46,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:16:46,303 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:46,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:46,306 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 16:16:46,325 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 11 treesize of output 8 [2018-04-11 16:16:46,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 16:16:46,327 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:46,328 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:46,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:46,336 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-04-11 16:16:46,349 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:46,350 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:46,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-11 16:16:46,351 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:46,358 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:46,358 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:24 [2018-04-11 16:16:46,386 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 13 treesize of output 10 [2018-04-11 16:16:46,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:16:46,387 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:46,389 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:46,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:46,398 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2018-04-11 16:16:46,414 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 16:16:46,415 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 16 treesize of output 4 [2018-04-11 16:16:46,415 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:46,416 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:46,421 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 16:16:46,421 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:21 [2018-04-11 16:16:46,458 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 19 treesize of output 20 [2018-04-11 16:16:46,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 16:16:46,459 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:46,463 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:46,471 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 16:16:46,471 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:28 [2018-04-11 16:16:46,561 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 22 treesize of output 20 [2018-04-11 16:16:46,562 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:16:46,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-11 16:16:46,563 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:46,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 16:16:46,568 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:46,569 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:46,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:46,576 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:38, output treesize:3 [2018-04-11 16:16:46,597 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 16:16:46,598 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:16:46,598 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-11 16:16:46,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-11 16:16:46,598 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-11 16:16:46,598 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-04-11 16:16:46,598 INFO L87 Difference]: Start difference. First operand 229 states and 259 transitions. Second operand 15 states. [2018-04-11 16:16:47,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:16:47,186 INFO L93 Difference]: Finished difference Result 300 states and 333 transitions. [2018-04-11 16:16:47,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-11 16:16:47,186 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 58 [2018-04-11 16:16:47,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:16:47,187 INFO L225 Difference]: With dead ends: 300 [2018-04-11 16:16:47,187 INFO L226 Difference]: Without dead ends: 295 [2018-04-11 16:16:47,187 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=599, Unknown=0, NotChecked=0, Total=756 [2018-04-11 16:16:47,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-04-11 16:16:47,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 229. [2018-04-11 16:16:47,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-04-11 16:16:47,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 258 transitions. [2018-04-11 16:16:47,189 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 258 transitions. Word has length 58 [2018-04-11 16:16:47,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:16:47,190 INFO L459 AbstractCegarLoop]: Abstraction has 229 states and 258 transitions. [2018-04-11 16:16:47,190 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-11 16:16:47,190 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 258 transitions. [2018-04-11 16:16:47,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-11 16:16:47,190 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:16:47,191 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:16:47,191 INFO L408 AbstractCegarLoop]: === Iteration 44 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 16:16:47,191 INFO L82 PathProgramCache]: Analyzing trace with hash -665999021, now seen corresponding path program 1 times [2018-04-11 16:16:47,191 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:16:47,191 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:16:47,191 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:16:47,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:16:47,192 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:16:47,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:16:47,202 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:16:47,214 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:16:47,215 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:16:47,215 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:16:47,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:16:47,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:16:47,239 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:16:47,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:16:47,247 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:47,251 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 16:16:47,251 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:47,254 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:47,254 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 16:16:47,271 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:47,271 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 16:16:47,272 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:47,279 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:47,280 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:47,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-11 16:16:47,280 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:47,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:47,286 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:31 [2018-04-11 16:16:47,308 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 13 treesize of output 10 [2018-04-11 16:16:47,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:16:47,310 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:47,311 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:47,319 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:47,319 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:49 [2018-04-11 16:16:47,370 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:47,371 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:47,371 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 40 [2018-04-11 16:16:47,371 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:47,385 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:47,386 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:47,387 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:47,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 49 [2018-04-11 16:16:47,387 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:47,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:47,399 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:64, output treesize:69 [2018-04-11 16:16:47,441 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:47,443 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:47,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 67 [2018-04-11 16:16:47,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-04-11 16:16:47,445 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:47,453 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:47,467 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:47,467 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:89, output treesize:92 [2018-04-11 16:16:47,540 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:47,543 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:47,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 118 [2018-04-11 16:16:47,546 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-11 16:16:47,551 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:47,562 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:47,576 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 16:16:47,576 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:138, output treesize:124 [2018-04-11 16:16:47,761 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:16:47,762 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:47,762 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 0 case distinctions, treesize of input 61 treesize of output 67 [2018-04-11 16:16:47,762 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:47,783 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:16:47,784 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:47,785 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:47,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 84 [2018-04-11 16:16:47,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-11 16:16:47,789 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:47,798 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:16:47,798 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 25 [2018-04-11 16:16:47,798 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:47,805 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:16:47,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-04-11 16:16:47,806 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:16:47,811 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:16:47,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 16:16:47,820 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:165, output treesize:28 [2018-04-11 16:16:47,916 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:16:47,917 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:16:47,917 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-11 16:16:47,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-11 16:16:47,917 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-11 16:16:47,917 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2018-04-11 16:16:47,918 INFO L87 Difference]: Start difference. First operand 229 states and 258 transitions. Second operand 24 states. [2018-04-11 16:16:50,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:16:50,619 INFO L93 Difference]: Finished difference Result 336 states and 379 transitions. [2018-04-11 16:16:50,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 16:16:50,620 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 58 [2018-04-11 16:16:50,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:16:50,620 INFO L225 Difference]: With dead ends: 336 [2018-04-11 16:16:50,620 INFO L226 Difference]: Without dead ends: 336 [2018-04-11 16:16:50,621 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 445 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=313, Invalid=1849, Unknown=0, NotChecked=0, Total=2162 [2018-04-11 16:16:50,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-04-11 16:16:50,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 249. [2018-04-11 16:16:50,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-04-11 16:16:50,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 283 transitions. [2018-04-11 16:16:50,623 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 283 transitions. Word has length 58 [2018-04-11 16:16:50,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:16:50,623 INFO L459 AbstractCegarLoop]: Abstraction has 249 states and 283 transitions. [2018-04-11 16:16:50,623 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-11 16:16:50,623 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 283 transitions. [2018-04-11 16:16:50,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-11 16:16:50,623 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:16:50,623 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:16:50,623 INFO L408 AbstractCegarLoop]: === Iteration 45 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 16:16:50,623 INFO L82 PathProgramCache]: Analyzing trace with hash -665999020, now seen corresponding path program 1 times [2018-04-11 16:16:50,623 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:16:50,623 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:16:50,624 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:16:50,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:16:50,624 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:16:50,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:16:50,630 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:16:50,637 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:16:50,637 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:16:50,637 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:16:50,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:16:50,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:16:50,654 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:16:50,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:16:50,656 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:50,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:16:50,664 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:50,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:50,666 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:11 [2018-04-11 16:16:50,685 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:50,686 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 16:16:50,686 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:50,694 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:50,694 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:50,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-11 16:16:50,695 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:50,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:50,701 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:31 [2018-04-11 16:16:50,722 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 13 treesize of output 10 [2018-04-11 16:16:50,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:16:50,734 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:50,735 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:50,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:50,743 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:56 [2018-04-11 16:16:50,797 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:50,798 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:50,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 53 [2018-04-11 16:16:50,799 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:50,814 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:50,814 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:50,815 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:50,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 32 [2018-04-11 16:16:50,816 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:50,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:16:50,826 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:79, output treesize:71 [2018-04-11 16:16:50,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-04-11 16:16:50,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 16:16:50,861 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:50,862 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:50,878 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:50,880 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:50,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 81 [2018-04-11 16:16:50,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-04-11 16:16:50,882 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:50,889 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:50,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:16:50,901 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:101, output treesize:98 [2018-04-11 16:16:50,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 60 [2018-04-11 16:16:50,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-04-11 16:16:50,968 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:50,971 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:50,986 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:50,989 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:50,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 138 [2018-04-11 16:16:50,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-04-11 16:16:50,992 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:51,002 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:51,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 16:16:51,015 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:187, output treesize:155 [2018-04-11 16:16:51,226 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:16:51,227 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:51,227 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:51,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 151 [2018-04-11 16:16:51,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-11 16:16:51,232 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:51,247 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:16:51,248 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 50 treesize of output 34 [2018-04-11 16:16:51,248 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:51,262 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:16:51,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 46 [2018-04-11 16:16:51,263 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:16:51,273 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:16:51,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 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 16:16:51,291 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:16:51,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 16:16:51,292 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:51,296 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 7 treesize of output 1 [2018-04-11 16:16:51,296 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:51,297 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:51,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 16:16:51,309 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 8 variables, input treesize:211, output treesize:41 [2018-04-11 16:16:51,390 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:16:51,390 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:16:51,390 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-11 16:16:51,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-11 16:16:51,390 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-11 16:16:51,391 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=534, Unknown=0, NotChecked=0, Total=600 [2018-04-11 16:16:51,391 INFO L87 Difference]: Start difference. First operand 249 states and 283 transitions. Second operand 25 states. [2018-04-11 16:16:54,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:16:54,634 INFO L93 Difference]: Finished difference Result 365 states and 408 transitions. [2018-04-11 16:16:54,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-11 16:16:54,634 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 58 [2018-04-11 16:16:54,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:16:54,635 INFO L225 Difference]: With dead ends: 365 [2018-04-11 16:16:54,635 INFO L226 Difference]: Without dead ends: 365 [2018-04-11 16:16:54,635 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=347, Invalid=2203, Unknown=0, NotChecked=0, Total=2550 [2018-04-11 16:16:54,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-04-11 16:16:54,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 244. [2018-04-11 16:16:54,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-04-11 16:16:54,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 277 transitions. [2018-04-11 16:16:54,637 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 277 transitions. Word has length 58 [2018-04-11 16:16:54,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:16:54,637 INFO L459 AbstractCegarLoop]: Abstraction has 244 states and 277 transitions. [2018-04-11 16:16:54,637 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-11 16:16:54,637 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 277 transitions. [2018-04-11 16:16:54,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-11 16:16:54,638 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:16:54,638 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:16:54,638 INFO L408 AbstractCegarLoop]: === Iteration 46 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 16:16:54,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1913196099, now seen corresponding path program 2 times [2018-04-11 16:16:54,638 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:16:54,638 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:16:54,638 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:16:54,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:16:54,638 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:16:54,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:16:54,643 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:16:54,647 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:16:54,647 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:16:54,647 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:16:54,647 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 16:16:54,659 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 16:16:54,659 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:16:54,661 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:16:54,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:16:54,664 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:54,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:16:54,667 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:54,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:54,669 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:11 [2018-04-11 16:16:54,692 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:54,692 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:54,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-11 16:16:54,693 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:54,701 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 16:16:54,701 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:54,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:54,708 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:34 [2018-04-11 16:16:54,730 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 13 treesize of output 10 [2018-04-11 16:16:54,731 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 9 [2018-04-11 16:16:54,731 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:54,732 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:54,743 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 13 treesize of output 10 [2018-04-11 16:16:54,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:16:54,744 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:54,746 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:54,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:54,755 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:64, output treesize:65 [2018-04-11 16:16:54,804 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:54,805 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:54,805 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:54,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 61 [2018-04-11 16:16:54,806 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:54,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 53 [2018-04-11 16:16:54,823 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:54,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:16:54,837 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:100, output treesize:107 [2018-04-11 16:16:54,878 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:54,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-04-11 16:16:54,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 16:16:54,882 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:54,886 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:54,906 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:54,908 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:54,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 81 [2018-04-11 16:16:54,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-04-11 16:16:54,910 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:54,917 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:54,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:16:54,933 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:135, output treesize:127 [2018-04-11 16:16:54,960 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:54,961 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 169 treesize of output 147 [2018-04-11 16:16:54,962 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 137 treesize of output 88 [2018-04-11 16:16:54,962 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:54,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-11 16:16:54,971 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:54,977 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:54,989 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 16:16:54,989 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:211, output treesize:123 [2018-04-11 16:16:55,040 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:55,042 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:55,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 105 [2018-04-11 16:16:55,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-04-11 16:16:55,045 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:55,052 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:55,062 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 16:16:55,062 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:138, output treesize:124 [2018-04-11 16:16:55,230 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:55,230 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:55,231 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:55,231 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:16:55,232 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 0 case distinctions, treesize of input 59 treesize of output 79 [2018-04-11 16:16:55,232 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:55,251 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:55,251 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:55,252 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:55,252 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:16:55,253 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:55,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 98 [2018-04-11 16:16:55,257 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:16:55,261 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 47 [2018-04-11 16:16:55,261 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 16:16:55,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2018-04-11 16:16:55,274 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:16:55,279 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:16:55,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 16:16:55,289 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:165, output treesize:28 [2018-04-11 16:16:55,383 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:16:55,383 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:16:55,383 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-11 16:16:55,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-11 16:16:55,383 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-11 16:16:55,383 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2018-04-11 16:16:55,383 INFO L87 Difference]: Start difference. First operand 244 states and 277 transitions. Second operand 24 states. [2018-04-11 16:16:58,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:16:58,566 INFO L93 Difference]: Finished difference Result 343 states and 386 transitions. [2018-04-11 16:16:58,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 16:16:58,566 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 58 [2018-04-11 16:16:58,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:16:58,566 INFO L225 Difference]: With dead ends: 343 [2018-04-11 16:16:58,567 INFO L226 Difference]: Without dead ends: 343 [2018-04-11 16:16:58,567 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=328, Invalid=1834, Unknown=0, NotChecked=0, Total=2162 [2018-04-11 16:16:58,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-04-11 16:16:58,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 249. [2018-04-11 16:16:58,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-04-11 16:16:58,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 283 transitions. [2018-04-11 16:16:58,569 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 283 transitions. Word has length 58 [2018-04-11 16:16:58,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:16:58,569 INFO L459 AbstractCegarLoop]: Abstraction has 249 states and 283 transitions. [2018-04-11 16:16:58,569 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-11 16:16:58,569 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 283 transitions. [2018-04-11 16:16:58,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-11 16:16:58,569 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:16:58,569 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:16:58,569 INFO L408 AbstractCegarLoop]: === Iteration 47 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 16:16:58,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1913196098, now seen corresponding path program 1 times [2018-04-11 16:16:58,569 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:16:58,569 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:16:58,570 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:16:58,570 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:16:58,570 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:16:58,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:16:58,575 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:16:58,577 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:16:58,577 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:16:58,577 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:16:58,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:16:58,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:16:58,591 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:16:58,607 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 16:16:58,607 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:58,617 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:58,617 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:58,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-11 16:16:58,618 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:58,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:58,625 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:32 [2018-04-11 16:16:58,648 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 13 treesize of output 10 [2018-04-11 16:16:58,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 9 [2018-04-11 16:16:58,650 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:58,651 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:58,662 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 13 treesize of output 10 [2018-04-11 16:16:58,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:16:58,664 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:58,665 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:58,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:58,674 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:58, output treesize:56 [2018-04-11 16:16:58,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-11 16:16:58,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-04-11 16:16:58,689 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:58,690 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:58,697 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:58,697 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:68, output treesize:53 [2018-04-11 16:16:58,724 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 11 treesize of output 14 [2018-04-11 16:16:58,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 16:16:58,726 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:58,727 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:58,737 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:58,737 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:72, output treesize:69 [2018-04-11 16:16:58,767 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:58,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-11 16:16:58,768 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:58,784 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:58,784 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:58,785 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:58,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 61 [2018-04-11 16:16:58,785 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:58,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:58,800 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:86, output treesize:93 [2018-04-11 16:16:58,851 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 0 case distinctions, treesize of input 27 treesize of output 34 [2018-04-11 16:16:58,851 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:58,875 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:58,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 68 [2018-04-11 16:16:58,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:16:58,879 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:58,887 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:58,899 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:58,899 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:111, output treesize:90 [2018-04-11 16:16:58,963 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:58,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 44 [2018-04-11 16:16:58,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 20 treesize of output 19 [2018-04-11 16:16:58,967 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:58,971 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:58,984 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 16:16:58,985 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:125, output treesize:133 [2018-04-11 16:16:59,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 113 [2018-04-11 16:16:59,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-04-11 16:16:59,015 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:59,025 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:16:59,038 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 16:16:59,038 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:155, output treesize:139 [2018-04-11 16:16:59,108 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:16:59,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 101 [2018-04-11 16:16:59,115 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 41 [2018-04-11 16:16:59,116 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-11 16:16:59,133 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 7 treesize of output 1 [2018-04-11 16:16:59,133 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:59,148 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:16:59,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 44 [2018-04-11 16:16:59,149 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:59,151 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:16:59,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 58 [2018-04-11 16:16:59,155 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-11 16:16:59,182 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 16:16:59,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-04-11 16:16:59,202 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:154, output treesize:71 [2018-04-11 16:16:59,274 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 22 treesize of output 20 [2018-04-11 16:16:59,277 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 12 [2018-04-11 16:16:59,277 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 16:16:59,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 16:16:59,282 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:16:59,284 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 16:16:59,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 16:16:59,292 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:45, output treesize:49 [2018-04-11 16:16:59,368 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:16:59,368 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:16:59,368 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-04-11 16:16:59,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-11 16:16:59,369 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-11 16:16:59,369 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=570, Unknown=0, NotChecked=0, Total=650 [2018-04-11 16:16:59,369 INFO L87 Difference]: Start difference. First operand 249 states and 283 transitions. Second operand 26 states. [2018-04-11 16:17:01,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:17:01,171 INFO L93 Difference]: Finished difference Result 376 states and 417 transitions. [2018-04-11 16:17:01,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-11 16:17:01,171 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 58 [2018-04-11 16:17:01,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:17:01,172 INFO L225 Difference]: With dead ends: 376 [2018-04-11 16:17:01,172 INFO L226 Difference]: Without dead ends: 375 [2018-04-11 16:17:01,172 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 643 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=360, Invalid=2292, Unknown=0, NotChecked=0, Total=2652 [2018-04-11 16:17:01,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-04-11 16:17:01,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 244. [2018-04-11 16:17:01,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-04-11 16:17:01,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 277 transitions. [2018-04-11 16:17:01,174 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 277 transitions. Word has length 58 [2018-04-11 16:17:01,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:17:01,174 INFO L459 AbstractCegarLoop]: Abstraction has 244 states and 277 transitions. [2018-04-11 16:17:01,174 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-11 16:17:01,174 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 277 transitions. [2018-04-11 16:17:01,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-11 16:17:01,174 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:17:01,174 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:17:01,174 INFO L408 AbstractCegarLoop]: === Iteration 48 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 16:17:01,175 INFO L82 PathProgramCache]: Analyzing trace with hash -724096735, now seen corresponding path program 2 times [2018-04-11 16:17:01,175 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:17:01,175 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:17:01,175 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:17:01,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:17:01,176 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:17:01,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:17:01,183 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:17:01,185 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:17:01,185 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:17:01,185 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:17:01,186 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 16:17:01,204 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 16:17:01,205 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:17:01,207 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:17:01,215 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:17:01,215 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:01,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:01,218 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 16:17:01,230 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 11 treesize of output 8 [2018-04-11 16:17:01,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 16:17:01,231 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:01,232 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:01,238 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:01,238 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:25 [2018-04-11 16:17:01,247 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:01,248 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:01,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-11 16:17:01,249 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:01,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:01,256 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:34 [2018-04-11 16:17:01,281 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 13 treesize of output 10 [2018-04-11 16:17:01,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:17:01,282 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:01,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:01,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:01,291 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:46 [2018-04-11 16:17:01,329 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:01,331 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 19 treesize of output 26 [2018-04-11 16:17:01,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 16:17:01,332 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:01,335 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:01,343 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 16:17:01,343 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:65 [2018-04-11 16:17:01,358 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:01,359 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:01,359 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:01,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 32 [2018-04-11 16:17:01,360 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:01,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:01,369 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:70, output treesize:63 [2018-04-11 16:17:01,399 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:01,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 57 [2018-04-11 16:17:01,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:17:01,402 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:01,409 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:01,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:01,419 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:76, output treesize:75 [2018-04-11 16:17:01,436 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 54 [2018-04-11 16:17:01,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2018-04-11 16:17:01,437 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:01,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2018-04-11 16:17:01,442 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:01,445 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:01,451 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:01,451 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:93, output treesize:36 [2018-04-11 16:17:01,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2018-04-11 16:17:01,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 16:17:01,494 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:01,499 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:01,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:01,506 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:47, output treesize:43 [2018-04-11 16:17:01,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2018-04-11 16:17:01,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 16:17:01,574 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:01,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 16:17:01,579 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:01,581 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:17:01,581 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 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-11 16:17:01,581 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:01,583 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:01,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:01,588 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:53, output treesize:3 [2018-04-11 16:17:01,610 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:17:01,610 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:17:01,610 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-11 16:17:01,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-11 16:17:01,611 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-11 16:17:01,611 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2018-04-11 16:17:01,611 INFO L87 Difference]: Start difference. First operand 244 states and 277 transitions. Second operand 21 states. [2018-04-11 16:17:02,002 WARN L151 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 58 DAG size of output 47 [2018-04-11 16:17:02,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:17:02,998 INFO L93 Difference]: Finished difference Result 337 states and 375 transitions. [2018-04-11 16:17:02,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-11 16:17:02,999 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 60 [2018-04-11 16:17:02,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:17:02,999 INFO L225 Difference]: With dead ends: 337 [2018-04-11 16:17:02,999 INFO L226 Difference]: Without dead ends: 335 [2018-04-11 16:17:03,000 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=260, Invalid=1380, Unknown=0, NotChecked=0, Total=1640 [2018-04-11 16:17:03,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-04-11 16:17:03,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 244. [2018-04-11 16:17:03,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-04-11 16:17:03,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 276 transitions. [2018-04-11 16:17:03,001 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 276 transitions. Word has length 60 [2018-04-11 16:17:03,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:17:03,002 INFO L459 AbstractCegarLoop]: Abstraction has 244 states and 276 transitions. [2018-04-11 16:17:03,002 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-11 16:17:03,002 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 276 transitions. [2018-04-11 16:17:03,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-11 16:17:03,002 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:17:03,002 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:17:03,002 INFO L408 AbstractCegarLoop]: === Iteration 49 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 16:17:03,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1079532791, now seen corresponding path program 1 times [2018-04-11 16:17:03,002 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:17:03,002 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:17:03,003 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:17:03,003 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:17:03,003 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:17:03,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:17:03,007 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:17:03,009 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:17:03,009 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:17:03,009 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:17:03,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:17:03,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:17:03,020 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:17:03,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:17:03,031 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:03,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:17:03,035 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:03,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:03,037 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:11 [2018-04-11 16:17:03,059 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:03,060 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 16:17:03,060 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:03,068 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:03,069 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:03,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-11 16:17:03,069 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:03,074 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:03,075 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:24 [2018-04-11 16:17:03,104 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 13 treesize of output 10 [2018-04-11 16:17:03,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:17:03,105 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:03,106 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:03,115 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:03,115 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:55 [2018-04-11 16:17:03,165 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 24 treesize of output 14 [2018-04-11 16:17:03,165 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:03,173 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:03,173 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:03,174 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 16:17:03,174 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:03,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:03,188 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:66, output treesize:40 [2018-04-11 16:17:03,215 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:03,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 44 [2018-04-11 16:17:03,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:17:03,218 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:03,223 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:03,238 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:03,238 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:53, output treesize:46 [2018-04-11 16:17:03,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 72 [2018-04-11 16:17:03,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 80 [2018-04-11 16:17:03,353 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:03,376 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:03,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 60 [2018-04-11 16:17:03,383 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 16:17:03,399 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 16:17:03,425 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-04-11 16:17:03,425 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:80, output treesize:107 [2018-04-11 16:17:03,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 67 [2018-04-11 16:17:03,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2018-04-11 16:17:03,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 16:17:03,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 31 [2018-04-11 16:17:03,526 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 16:17:03,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 35 [2018-04-11 16:17:03,530 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-11 16:17:03,558 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 57 treesize of output 50 [2018-04-11 16:17:03,558 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:03,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 43 [2018-04-11 16:17:03,586 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-11 16:17:03,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2018-04-11 16:17:03,612 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:03,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-04-11 16:17:03,613 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:03,625 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 16:17:03,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 44 [2018-04-11 16:17:03,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-11 16:17:03,639 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:03,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 21 [2018-04-11 16:17:03,646 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-04-11 16:17:03,651 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 16:17:03,664 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-11 16:17:03,664 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 9 variables, input treesize:125, output treesize:13 [2018-04-11 16:17:03,707 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:17:03,707 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:17:03,707 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-11 16:17:03,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-11 16:17:03,707 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-11 16:17:03,707 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2018-04-11 16:17:03,708 INFO L87 Difference]: Start difference. First operand 244 states and 276 transitions. Second operand 21 states. [2018-04-11 16:17:04,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:17:04,982 INFO L93 Difference]: Finished difference Result 372 states and 414 transitions. [2018-04-11 16:17:04,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-11 16:17:04,982 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 60 [2018-04-11 16:17:04,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:17:04,983 INFO L225 Difference]: With dead ends: 372 [2018-04-11 16:17:04,983 INFO L226 Difference]: Without dead ends: 371 [2018-04-11 16:17:04,984 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=272, Invalid=1534, Unknown=0, NotChecked=0, Total=1806 [2018-04-11 16:17:04,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-04-11 16:17:04,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 281. [2018-04-11 16:17:04,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-04-11 16:17:04,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 326 transitions. [2018-04-11 16:17:04,986 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 326 transitions. Word has length 60 [2018-04-11 16:17:04,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:17:04,986 INFO L459 AbstractCegarLoop]: Abstraction has 281 states and 326 transitions. [2018-04-11 16:17:04,986 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-11 16:17:04,986 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 326 transitions. [2018-04-11 16:17:04,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-11 16:17:04,987 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:17:04,987 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:17:04,987 INFO L408 AbstractCegarLoop]: === Iteration 50 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 16:17:04,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1981847483, now seen corresponding path program 3 times [2018-04-11 16:17:04,987 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:17:04,987 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:17:04,988 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:17:04,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:17:04,988 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:17:04,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:17:04,996 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:17:05,000 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:17:05,000 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:17:05,000 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:17:05,000 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 16:17:05,026 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-11 16:17:05,026 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:17:05,030 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:17:05,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:17:05,041 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:05,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:05,044 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 16:17:05,064 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:05,065 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:05,065 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 16:17:05,065 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:05,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 16:17:05,072 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:05,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:05,077 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:25 [2018-04-11 16:17:05,096 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 13 treesize of output 10 [2018-04-11 16:17:05,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:17:05,097 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:05,098 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:05,109 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 13 treesize of output 10 [2018-04-11 16:17:05,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:17:05,110 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:05,111 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:05,119 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:05,119 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:56, output treesize:48 [2018-04-11 16:17:05,163 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 11 treesize of output 14 [2018-04-11 16:17:05,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 16:17:05,164 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:05,165 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:05,177 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 16:17:05,177 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:82, output treesize:84 [2018-04-11 16:17:05,197 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:05,198 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:05,198 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:05,199 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:05,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-11 16:17:05,199 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:05,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-11 16:17:05,216 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:05,232 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:05,232 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:98, output treesize:96 [2018-04-11 16:17:05,274 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:05,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-04-11 16:17:05,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 16:17:05,279 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:05,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:05,304 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:05,306 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:05,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 94 [2018-04-11 16:17:05,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-04-11 16:17:05,308 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:05,317 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:05,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:05,333 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:119, output treesize:116 [2018-04-11 16:17:05,357 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:05,358 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 49 treesize of output 39 [2018-04-11 16:17:05,359 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 15 treesize of output 3 [2018-04-11 16:17:05,360 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:05,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-04-11 16:17:05,368 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:05,371 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:05,382 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 16:17:05,382 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:155, output treesize:113 [2018-04-11 16:17:05,443 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:05,445 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:05,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 59 [2018-04-11 16:17:05,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 46 [2018-04-11 16:17:05,447 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:05,452 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:05,467 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 16:17:05,467 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:127, output treesize:110 [2018-04-11 16:17:05,494 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:05,495 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:05,522 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:05,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 119 [2018-04-11 16:17:05,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-11 16:17:05,526 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:05,544 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:05,557 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 16:17:05,558 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:127, output treesize:111 [2018-04-11 16:17:05,613 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:05,614 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:05,615 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:05,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 97 [2018-04-11 16:17:05,619 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:17:05,622 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 46 [2018-04-11 16:17:05,622 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 16:17:05,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2018-04-11 16:17:05,635 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:05,640 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:05,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-04-11 16:17:05,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 16:17:05,652 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:05,652 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:05,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:05,661 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:122, output treesize:31 [2018-04-11 16:17:05,709 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:05,710 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:05,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2018-04-11 16:17:05,718 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 31 [2018-04-11 16:17:05,719 INFO L267 ElimStorePlain]: Start of recursive call 3: 6 dim-0 vars, End of recursive call: 6 dim-0 vars, and 8 xjuncts. [2018-04-11 16:17:05,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 16:17:05,729 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:05,732 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 16:17:05,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 16:17:05,740 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:41, output treesize:49 [2018-04-11 16:17:05,827 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 16:17:05,827 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:17:05,827 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-11 16:17:05,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-11 16:17:05,827 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-11 16:17:05,827 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=495, Unknown=0, NotChecked=0, Total=552 [2018-04-11 16:17:05,827 INFO L87 Difference]: Start difference. First operand 281 states and 326 transitions. Second operand 24 states. [2018-04-11 16:17:07,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:17:07,645 INFO L93 Difference]: Finished difference Result 339 states and 376 transitions. [2018-04-11 16:17:07,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-11 16:17:07,645 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 60 [2018-04-11 16:17:07,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:17:07,646 INFO L225 Difference]: With dead ends: 339 [2018-04-11 16:17:07,646 INFO L226 Difference]: Without dead ends: 338 [2018-04-11 16:17:07,646 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=284, Invalid=1878, Unknown=0, NotChecked=0, Total=2162 [2018-04-11 16:17:07,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-04-11 16:17:07,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 268. [2018-04-11 16:17:07,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-04-11 16:17:07,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 306 transitions. [2018-04-11 16:17:07,648 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 306 transitions. Word has length 60 [2018-04-11 16:17:07,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:17:07,648 INFO L459 AbstractCegarLoop]: Abstraction has 268 states and 306 transitions. [2018-04-11 16:17:07,648 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-11 16:17:07,648 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 306 transitions. [2018-04-11 16:17:07,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-11 16:17:07,649 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:17:07,649 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:17:07,649 INFO L408 AbstractCegarLoop]: === Iteration 51 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 16:17:07,649 INFO L82 PathProgramCache]: Analyzing trace with hash 819016417, now seen corresponding path program 2 times [2018-04-11 16:17:07,649 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:17:07,649 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:17:07,649 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:17:07,649 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:17:07,649 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:17:07,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:17:07,654 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:17:07,656 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:17:07,656 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:17:07,657 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:17:07,657 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 16:17:07,666 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 16:17:07,667 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:17:07,669 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:17:07,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 16:17:07,671 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:07,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 16:17:07,675 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:07,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:07,678 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 16:17:07,694 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 11 treesize of output 8 [2018-04-11 16:17:07,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 16:17:07,695 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:07,696 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:07,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:07,702 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:27 [2018-04-11 16:17:07,714 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:07,719 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 16:17:07,719 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:07,744 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:07,745 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:07,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-11 16:17:07,745 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:07,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:07,758 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:41 [2018-04-11 16:17:07,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 8 [2018-04-11 16:17:07,793 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:07,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 16:17:07,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:17:07,805 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:07,807 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:07,815 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:07,816 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:61, output treesize:46 [2018-04-11 16:17:07,873 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:07,875 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 19 treesize of output 26 [2018-04-11 16:17:07,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 16:17:07,877 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:07,880 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:07,889 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 16:17:07,889 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:65 [2018-04-11 16:17:07,913 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:07,914 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:07,915 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:07,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 32 [2018-04-11 16:17:07,915 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:07,925 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:07,925 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:70, output treesize:63 [2018-04-11 16:17:07,959 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:07,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 57 [2018-04-11 16:17:07,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:17:07,963 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:07,969 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:07,979 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:07,980 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:76, output treesize:75 [2018-04-11 16:17:08,001 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 54 [2018-04-11 16:17:08,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 13 [2018-04-11 16:17:08,002 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:08,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2018-04-11 16:17:08,008 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:08,011 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:08,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:08,019 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:93, output treesize:36 [2018-04-11 16:17:08,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2018-04-11 16:17:08,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 16:17:08,089 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:08,094 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:08,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:08,103 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:47, output treesize:43 [2018-04-11 16:17:08,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2018-04-11 16:17:08,196 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:17:08,196 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 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-11 16:17:08,196 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:08,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 16:17:08,203 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:08,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 16:17:08,206 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:08,207 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:08,214 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:08,215 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:53, output treesize:3 [2018-04-11 16:17:08,254 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:17:08,255 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:17:08,255 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-11 16:17:08,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-11 16:17:08,255 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-11 16:17:08,255 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2018-04-11 16:17:08,255 INFO L87 Difference]: Start difference. First operand 268 states and 306 transitions. Second operand 21 states. [2018-04-11 16:17:09,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:17:09,570 INFO L93 Difference]: Finished difference Result 376 states and 420 transitions. [2018-04-11 16:17:09,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-11 16:17:09,570 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 60 [2018-04-11 16:17:09,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:17:09,571 INFO L225 Difference]: With dead ends: 376 [2018-04-11 16:17:09,571 INFO L226 Difference]: Without dead ends: 371 [2018-04-11 16:17:09,571 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=254, Invalid=1386, Unknown=0, NotChecked=0, Total=1640 [2018-04-11 16:17:09,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-04-11 16:17:09,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 268. [2018-04-11 16:17:09,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-04-11 16:17:09,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 305 transitions. [2018-04-11 16:17:09,573 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 305 transitions. Word has length 60 [2018-04-11 16:17:09,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:17:09,573 INFO L459 AbstractCegarLoop]: Abstraction has 268 states and 305 transitions. [2018-04-11 16:17:09,573 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-11 16:17:09,573 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 305 transitions. [2018-04-11 16:17:09,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-11 16:17:09,573 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:17:09,573 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 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] [2018-04-11 16:17:09,573 INFO L408 AbstractCegarLoop]: === Iteration 52 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 16:17:09,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1721331109, now seen corresponding path program 5 times [2018-04-11 16:17:09,574 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:17:09,574 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:17:09,574 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:17:09,574 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:17:09,574 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:17:09,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:17:09,579 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:17:09,584 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:17:09,584 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:17:09,584 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:17:09,584 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 16:17:09,609 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-04-11 16:17:09,609 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:17:09,612 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:17:09,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 16:17:09,637 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:09,649 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:09,649 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:09,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 16:17:09,650 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:09,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:09,660 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:32 [2018-04-11 16:17:09,691 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 13 treesize of output 10 [2018-04-11 16:17:09,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:17:09,692 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:09,694 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:09,705 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 13 treesize of output 10 [2018-04-11 16:17:09,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 9 [2018-04-11 16:17:09,706 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:09,708 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:09,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:09,717 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:55, output treesize:56 [2018-04-11 16:17:09,775 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:09,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-11 16:17:09,776 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:09,804 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:09,804 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:09,805 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:09,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-04-11 16:17:09,806 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:09,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:09,816 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:76, output treesize:68 [2018-04-11 16:17:09,857 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:09,859 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:09,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 66 [2018-04-11 16:17:09,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-04-11 16:17:09,861 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:09,869 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:09,884 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:09,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 30 [2018-04-11 16:17:09,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 16:17:09,888 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:09,891 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:09,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:09,904 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:98, output treesize:95 [2018-04-11 16:17:09,989 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 11 treesize of output 20 [2018-04-11 16:17:09,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-11 16:17:09,991 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:09,992 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:10,007 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 16:17:10,008 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:139, output treesize:147 [2018-04-11 16:17:10,036 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:10,039 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:10,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 207 treesize of output 174 [2018-04-11 16:17:10,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-04-11 16:17:10,044 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:10,060 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:10,083 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:10,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 95 [2018-04-11 16:17:10,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-04-11 16:17:10,089 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:10,096 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:10,115 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:10,116 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:225, output treesize:193 [2018-04-11 16:17:10,178 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:10,180 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 65 [2018-04-11 16:17:10,181 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 7 treesize of output 1 [2018-04-11 16:17:10,181 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:10,189 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 7 treesize of output 1 [2018-04-11 16:17:10,189 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:10,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-11 16:17:10,193 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:10,195 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:10,209 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 16:17:10,209 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:180, output treesize:137 [2018-04-11 16:17:10,262 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:10,263 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:10,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 100 [2018-04-11 16:17:10,266 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 7 treesize of output 1 [2018-04-11 16:17:10,266 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:10,278 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:17:10,278 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 55 treesize of output 35 [2018-04-11 16:17:10,278 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:10,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2018-04-11 16:17:10,288 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:10,296 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:10,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:10,305 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:138, output treesize:32 [2018-04-11 16:17:10,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 16:17:10,360 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 11 treesize of output 8 [2018-04-11 16:17:10,360 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 16:17:10,362 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 16:17:10,371 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 16:17:10,371 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:68 [2018-04-11 16:17:10,459 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:17:10,460 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:17:10,460 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-04-11 16:17:10,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-11 16:17:10,460 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-11 16:17:10,460 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=575, Unknown=1, NotChecked=0, Total=650 [2018-04-11 16:17:10,460 INFO L87 Difference]: Start difference. First operand 268 states and 305 transitions. Second operand 26 states. [2018-04-11 16:17:12,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:17:12,549 INFO L93 Difference]: Finished difference Result 375 states and 415 transitions. [2018-04-11 16:17:12,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-11 16:17:12,549 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 60 [2018-04-11 16:17:12,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:17:12,550 INFO L225 Difference]: With dead ends: 375 [2018-04-11 16:17:12,550 INFO L226 Difference]: Without dead ends: 374 [2018-04-11 16:17:12,550 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=341, Invalid=2309, Unknown=2, NotChecked=0, Total=2652 [2018-04-11 16:17:12,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2018-04-11 16:17:12,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 271. [2018-04-11 16:17:12,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-04-11 16:17:12,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 308 transitions. [2018-04-11 16:17:12,552 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 308 transitions. Word has length 60 [2018-04-11 16:17:12,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:17:12,553 INFO L459 AbstractCegarLoop]: Abstraction has 271 states and 308 transitions. [2018-04-11 16:17:12,553 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-11 16:17:12,553 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 308 transitions. [2018-04-11 16:17:12,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-11 16:17:12,553 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:17:12,553 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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 16:17:12,553 INFO L408 AbstractCegarLoop]: === Iteration 53 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 16:17:12,553 INFO L82 PathProgramCache]: Analyzing trace with hash 966584979, now seen corresponding path program 3 times [2018-04-11 16:17:12,553 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:17:12,553 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:17:12,554 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:17:12,554 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:17:12,554 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:17:12,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:17:12,560 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:17:12,562 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:17:12,562 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:17:12,562 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:17:12,562 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 16:17:12,582 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-11 16:17:12,582 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:17:12,584 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:17:12,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 16:17:12,586 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:12,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:12,589 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 16:17:12,603 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 11 treesize of output 8 [2018-04-11 16:17:12,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 16:17:12,604 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:12,605 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:12,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:12,611 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:25 [2018-04-11 16:17:12,621 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:12,622 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:12,622 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 16:17:12,622 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:12,628 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:12,628 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:24 [2018-04-11 16:17:12,649 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 13 treesize of output 10 [2018-04-11 16:17:12,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:17:12,650 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:12,651 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:12,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:12,659 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:35 [2018-04-11 16:17:12,702 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:12,705 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 19 treesize of output 26 [2018-04-11 16:17:12,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 16:17:12,706 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:12,710 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:12,727 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 16:17:12,727 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:57, output treesize:59 [2018-04-11 16:17:12,752 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:12,753 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:12,754 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:12,754 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:12,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 46 [2018-04-11 16:17:12,755 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:12,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:12,770 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:70, output treesize:78 [2018-04-11 16:17:12,814 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:12,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 58 [2018-04-11 16:17:12,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:17:12,818 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:12,824 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:12,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:12,839 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:96, output treesize:90 [2018-04-11 16:17:12,913 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:12,913 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:12,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 65 [2018-04-11 16:17:12,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-11 16:17:12,919 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:12,924 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:12,938 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 16:17:12,938 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:142, output treesize:145 [2018-04-11 16:17:12,963 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:12,964 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:12,964 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:12,965 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:12,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 79 [2018-04-11 16:17:12,965 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:12,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:12,980 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:150, output treesize:142 [2018-04-11 16:17:13,026 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:13,027 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:13,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 125 [2018-04-11 16:17:13,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:17:13,033 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:13,043 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:13,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:13,058 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:155, output treesize:148 [2018-04-11 16:17:13,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 186 treesize of output 104 [2018-04-11 16:17:13,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 21 [2018-04-11 16:17:13,087 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:13,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 24 [2018-04-11 16:17:13,095 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:13,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2018-04-11 16:17:13,104 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:13,110 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:13,119 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:13,119 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:202, output treesize:55 [2018-04-11 16:17:13,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 54 [2018-04-11 16:17:13,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 16:17:13,194 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:13,211 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:13,223 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:13,223 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:66, output treesize:62 [2018-04-11 16:17:13,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 50 [2018-04-11 16:17:13,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 16:17:13,286 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:13,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 16:17:13,293 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:13,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 16:17:13,297 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:13,300 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:17:13,300 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 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-11 16:17:13,300 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:13,301 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:13,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:13,309 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 10 variables, input treesize:72, output treesize:3 [2018-04-11 16:17:13,341 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 2 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:17:13,341 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:17:13,341 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-04-11 16:17:13,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-11 16:17:13,341 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-11 16:17:13,341 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2018-04-11 16:17:13,342 INFO L87 Difference]: Start difference. First operand 271 states and 308 transitions. Second operand 26 states. [2018-04-11 16:17:17,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:17:17,209 INFO L93 Difference]: Finished difference Result 373 states and 416 transitions. [2018-04-11 16:17:17,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-11 16:17:17,209 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 61 [2018-04-11 16:17:17,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:17:17,210 INFO L225 Difference]: With dead ends: 373 [2018-04-11 16:17:17,210 INFO L226 Difference]: Without dead ends: 373 [2018-04-11 16:17:17,210 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=351, Invalid=2404, Unknown=1, NotChecked=0, Total=2756 [2018-04-11 16:17:17,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2018-04-11 16:17:17,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 285. [2018-04-11 16:17:17,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-04-11 16:17:17,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 324 transitions. [2018-04-11 16:17:17,212 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 324 transitions. Word has length 61 [2018-04-11 16:17:17,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:17:17,212 INFO L459 AbstractCegarLoop]: Abstraction has 285 states and 324 transitions. [2018-04-11 16:17:17,212 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-11 16:17:17,212 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 324 transitions. [2018-04-11 16:17:17,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-11 16:17:17,212 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:17:17,212 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:17:17,212 INFO L408 AbstractCegarLoop]: === Iteration 54 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 16:17:17,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1044525437, now seen corresponding path program 4 times [2018-04-11 16:17:17,212 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:17:17,213 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:17:17,213 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:17:17,213 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:17:17,213 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:17:17,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:17:17,230 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:17:17,240 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:17:17,240 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:17:17,240 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:17:17,241 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 16:17:17,261 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 16:17:17,262 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:17:17,264 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:17:17,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:17:17,267 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:17,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:17:17,271 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:17,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:17,274 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:11 [2018-04-11 16:17:17,292 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:17,293 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:17,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-11 16:17:17,293 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:17,299 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 16:17:17,300 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:17,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:17,305 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:31 [2018-04-11 16:17:17,324 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 13 treesize of output 10 [2018-04-11 16:17:17,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:17:17,325 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:17,326 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:17,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:17,333 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:56 [2018-04-11 16:17:17,377 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:17,378 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:17,378 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:17,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 61 [2018-04-11 16:17:17,379 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:17,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 53 [2018-04-11 16:17:17,391 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:17,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:17,401 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:79, output treesize:86 [2018-04-11 16:17:17,433 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:17,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 66 [2018-04-11 16:17:17,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:17:17,436 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:17,442 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:17,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:17,454 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:104, output treesize:104 [2018-04-11 16:17:17,514 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:17,515 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:17,515 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:17,516 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:17,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 138 [2018-04-11 16:17:17,516 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:17,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 124 [2018-04-11 16:17:17,535 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:17,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:17,553 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:157, output treesize:180 [2018-04-11 16:17:17,608 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:17,609 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:17,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 143 [2018-04-11 16:17:17,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:17:17,614 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:17,628 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:17,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:17,648 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:193, output treesize:198 [2018-04-11 16:17:17,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 284 treesize of output 182 [2018-04-11 16:17:17,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-04-11 16:17:17,750 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:17,769 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:17,789 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 16:17:17,789 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:304, output treesize:282 [2018-04-11 16:17:17,885 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 139 [2018-04-11 16:17:17,886 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:17,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 220 treesize of output 123 [2018-04-11 16:17:17,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 26 [2018-04-11 16:17:17,910 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:17,920 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 7 treesize of output 1 [2018-04-11 16:17:17,921 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:17,930 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:17:17,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 29 [2018-04-11 16:17:17,930 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:17,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2018-04-11 16:17:17,939 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:17,946 INFO L267 ElimStorePlain]: Start of recursive call 3: 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:17,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:17,961 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:301, output treesize:45 [2018-04-11 16:17:18,146 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:17:18,146 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:17:18,146 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-04-11 16:17:18,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-11 16:17:18,146 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-11 16:17:18,146 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=563, Unknown=0, NotChecked=0, Total=650 [2018-04-11 16:17:18,146 INFO L87 Difference]: Start difference. First operand 285 states and 324 transitions. Second operand 26 states. [2018-04-11 16:17:22,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:17:22,303 INFO L93 Difference]: Finished difference Result 382 states and 430 transitions. [2018-04-11 16:17:22,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-11 16:17:22,347 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 61 [2018-04-11 16:17:22,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:17:22,347 INFO L225 Difference]: With dead ends: 382 [2018-04-11 16:17:22,347 INFO L226 Difference]: Without dead ends: 382 [2018-04-11 16:17:22,348 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 604 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=359, Invalid=2191, Unknown=0, NotChecked=0, Total=2550 [2018-04-11 16:17:22,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-04-11 16:17:22,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 306. [2018-04-11 16:17:22,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-04-11 16:17:22,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 349 transitions. [2018-04-11 16:17:22,350 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 349 transitions. Word has length 61 [2018-04-11 16:17:22,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:17:22,350 INFO L459 AbstractCegarLoop]: Abstraction has 306 states and 349 transitions. [2018-04-11 16:17:22,350 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-11 16:17:22,350 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 349 transitions. [2018-04-11 16:17:22,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-11 16:17:22,350 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:17:22,350 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:17:22,350 INFO L408 AbstractCegarLoop]: === Iteration 55 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 16:17:22,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1044525438, now seen corresponding path program 3 times [2018-04-11 16:17:22,350 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:17:22,351 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:17:22,351 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:17:22,351 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:17:22,351 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:17:22,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:17:22,356 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:17:22,363 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:17:22,363 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:17:22,363 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:17:22,363 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 16:17:22,391 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-04-11 16:17:22,391 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:17:22,393 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:17:22,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:17:22,395 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:22,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:17:22,399 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:22,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:22,402 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 16:17:22,429 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:22,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 16:17:22,430 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:22,442 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:22,443 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:22,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-11 16:17:22,443 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:22,451 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:22,451 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:41 [2018-04-11 16:17:22,477 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 18 treesize of output 8 [2018-04-11 16:17:22,477 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:22,488 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 13 treesize of output 10 [2018-04-11 16:17:22,489 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:17:22,489 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:22,490 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:22,501 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 13 treesize of output 10 [2018-04-11 16:17:22,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 9 [2018-04-11 16:17:22,502 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:22,503 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:22,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:22,512 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:71, output treesize:58 [2018-04-11 16:17:22,564 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:22,565 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:22,565 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:22,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 61 [2018-04-11 16:17:22,566 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:22,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:22,578 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:78, output treesize:86 [2018-04-11 16:17:22,620 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:22,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 65 [2018-04-11 16:17:22,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:17:22,624 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:22,631 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:22,650 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:22,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 30 [2018-04-11 16:17:22,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 16:17:22,653 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:22,657 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:22,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:22,681 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:124, output treesize:105 [2018-04-11 16:17:22,775 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:22,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 29 [2018-04-11 16:17:22,776 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:22,796 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:22,797 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:22,798 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:22,798 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:22,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 79 [2018-04-11 16:17:22,799 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:22,815 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:22,815 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:155, output treesize:146 [2018-04-11 16:17:22,868 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:22,869 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:22,873 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 122 [2018-04-11 16:17:22,875 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:17:22,875 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:22,887 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:22,908 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:22,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 36 [2018-04-11 16:17:22,918 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-04-11 16:17:22,918 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:22,922 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:22,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:22,941 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:169, output treesize:188 [2018-04-11 16:17:23,080 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:23,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 334 treesize of output 237 [2018-04-11 16:17:23,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 72 [2018-04-11 16:17:23,084 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:23,098 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:23,119 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:23,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 194 [2018-04-11 16:17:23,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2018-04-11 16:17:23,126 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:23,133 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:23,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:23,153 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:355, output treesize:289 [2018-04-11 16:17:23,274 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:23,275 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:23,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 277 treesize of output 174 [2018-04-11 16:17:23,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 45 [2018-04-11 16:17:23,280 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:23,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 54 [2018-04-11 16:17:23,297 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:23,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 13 treesize of output 1 [2018-04-11 16:17:23,312 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:23,325 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:17:23,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 31 [2018-04-11 16:17:23,326 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:23,336 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:23,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 45 [2018-04-11 16:17:23,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-04-11 16:17:23,357 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:23,362 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 7 treesize of output 1 [2018-04-11 16:17:23,362 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:23,374 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:17:23,374 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 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 16:17:23,374 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:23,376 INFO L267 ElimStorePlain]: Start of recursive call 7: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:23,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:23,388 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 7 variables, input treesize:310, output treesize:22 [2018-04-11 16:17:23,467 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:17:23,467 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:17:23,467 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-04-11 16:17:23,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-11 16:17:23,468 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-11 16:17:23,468 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=634, Unknown=0, NotChecked=0, Total=702 [2018-04-11 16:17:23,468 INFO L87 Difference]: Start difference. First operand 306 states and 349 transitions. Second operand 27 states. [2018-04-11 16:17:25,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:17:25,865 INFO L93 Difference]: Finished difference Result 410 states and 460 transitions. [2018-04-11 16:17:25,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-11 16:17:25,865 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 61 [2018-04-11 16:17:25,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:17:25,866 INFO L225 Difference]: With dead ends: 410 [2018-04-11 16:17:25,866 INFO L226 Difference]: Without dead ends: 410 [2018-04-11 16:17:25,866 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 558 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=330, Invalid=2426, Unknown=0, NotChecked=0, Total=2756 [2018-04-11 16:17:25,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2018-04-11 16:17:25,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 304. [2018-04-11 16:17:25,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-04-11 16:17:25,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 346 transitions. [2018-04-11 16:17:25,868 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 346 transitions. Word has length 61 [2018-04-11 16:17:25,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:17:25,868 INFO L459 AbstractCegarLoop]: Abstraction has 304 states and 346 transitions. [2018-04-11 16:17:25,868 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-11 16:17:25,869 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 346 transitions. [2018-04-11 16:17:25,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-11 16:17:25,869 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:17:25,869 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:17:25,869 INFO L408 AbstractCegarLoop]: === Iteration 56 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 16:17:25,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1558452435, now seen corresponding path program 5 times [2018-04-11 16:17:25,869 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:17:25,869 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:17:25,870 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:17:25,870 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:17:25,870 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:17:25,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:17:25,876 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:17:25,879 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:17:25,879 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:17:25,879 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:17:25,880 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 16:17:25,907 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-04-11 16:17:25,907 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:17:25,910 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:17:25,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:17:25,931 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:25,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:25,933 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 16:17:25,959 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:25,959 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:25,959 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 16:17:25,959 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:25,965 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:25,965 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2018-04-11 16:17:25,980 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 13 treesize of output 10 [2018-04-11 16:17:25,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:17:25,984 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:25,986 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:25,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:25,992 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:28 [2018-04-11 16:17:26,024 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:26,024 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:26,025 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 16:17:26,025 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:26,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:26,032 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:43 [2018-04-11 16:17:26,061 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:26,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-04-11 16:17:26,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:17:26,064 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:26,068 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:26,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:26,076 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:60 [2018-04-11 16:17:26,132 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:26,134 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:26,134 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:26,135 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:26,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 107 [2018-04-11 16:17:26,135 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:26,149 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:26,149 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:95, output treesize:119 [2018-04-11 16:17:26,198 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:26,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 104 [2018-04-11 16:17:26,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 119 [2018-04-11 16:17:26,211 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:26,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 55 [2018-04-11 16:17:26,256 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 16:17:26,285 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 16:17:26,308 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 2 xjuncts. [2018-04-11 16:17:26,308 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:132, output treesize:214 [2018-04-11 16:17:26,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 101 [2018-04-11 16:17:26,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-04-11 16:17:26,446 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:26,455 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:26,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 225 treesize of output 147 [2018-04-11 16:17:26,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-04-11 16:17:26,505 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:26,519 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:26,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2018-04-11 16:17:26,547 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 9 variables, input treesize:354, output treesize:316 [2018-04-11 16:17:26,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 1 case distinctions, treesize of input 212 treesize of output 133 [2018-04-11 16:17:26,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 100 [2018-04-11 16:17:26,658 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:26,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 84 [2018-04-11 16:17:26,693 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:26,726 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 104 treesize of output 97 [2018-04-11 16:17:26,726 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:26,758 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 84 treesize of output 77 [2018-04-11 16:17:26,758 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:26,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 77 [2018-04-11 16:17:26,789 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:26,820 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:17:26,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 61 [2018-04-11 16:17:26,820 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:26,849 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:17:26,849 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 77 treesize of output 65 [2018-04-11 16:17:26,849 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:26,875 INFO L267 ElimStorePlain]: Start of recursive call 2: 7 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-04-11 16:17:26,918 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 89 [2018-04-11 16:17:26,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2018-04-11 16:17:26,919 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:26,930 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:17:26,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2018-04-11 16:17:26,931 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:26,944 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 7 treesize of output 1 [2018-04-11 16:17:26,944 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:26,951 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:26,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 2 dim-2 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2018-04-11 16:17:26,987 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 13 variables, input treesize:334, output treesize:115 [2018-04-11 16:17:27,095 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:17:27,095 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:17:27,095 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-11 16:17:27,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-11 16:17:27,096 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-11 16:17:27,096 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=524, Unknown=0, NotChecked=0, Total=600 [2018-04-11 16:17:27,096 INFO L87 Difference]: Start difference. First operand 304 states and 346 transitions. Second operand 25 states. [2018-04-11 16:17:29,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:17:29,562 INFO L93 Difference]: Finished difference Result 422 states and 475 transitions. [2018-04-11 16:17:29,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-11 16:17:29,563 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 61 [2018-04-11 16:17:29,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:17:29,563 INFO L225 Difference]: With dead ends: 422 [2018-04-11 16:17:29,564 INFO L226 Difference]: Without dead ends: 422 [2018-04-11 16:17:29,564 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=342, Invalid=2208, Unknown=0, NotChecked=0, Total=2550 [2018-04-11 16:17:29,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2018-04-11 16:17:29,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 325. [2018-04-11 16:17:29,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-04-11 16:17:29,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 371 transitions. [2018-04-11 16:17:29,566 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 371 transitions. Word has length 61 [2018-04-11 16:17:29,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:17:29,566 INFO L459 AbstractCegarLoop]: Abstraction has 325 states and 371 transitions. [2018-04-11 16:17:29,566 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-11 16:17:29,566 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 371 transitions. [2018-04-11 16:17:29,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-11 16:17:29,566 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:17:29,566 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:17:29,566 INFO L408 AbstractCegarLoop]: === Iteration 57 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 16:17:29,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1558452436, now seen corresponding path program 4 times [2018-04-11 16:17:29,567 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:17:29,567 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:17:29,567 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:17:29,567 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:17:29,567 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:17:29,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:17:29,572 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:17:29,575 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:17:29,575 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:17:29,575 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:17:29,575 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 16:17:29,592 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 16:17:29,592 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:17:29,595 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:17:29,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:17:29,597 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:29,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:29,599 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 16:17:29,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:17:29,615 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:29,624 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:29,625 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:29,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-11 16:17:29,625 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:29,641 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:29,641 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:32 [2018-04-11 16:17:29,666 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 13 treesize of output 10 [2018-04-11 16:17:29,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 9 [2018-04-11 16:17:29,668 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:29,669 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:29,681 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 13 treesize of output 10 [2018-04-11 16:17:29,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:17:29,682 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:29,684 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:29,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:29,693 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:55, output treesize:56 [2018-04-11 16:17:29,750 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:29,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-11 16:17:29,751 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:29,771 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:29,772 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:29,772 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:29,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 58 [2018-04-11 16:17:29,773 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:29,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:29,784 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:76, output treesize:83 [2018-04-11 16:17:29,821 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:29,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 66 [2018-04-11 16:17:29,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:17:29,825 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:29,832 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:29,846 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:29,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 30 [2018-04-11 16:17:29,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 16:17:29,850 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:29,853 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:29,866 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:29,866 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:114, output treesize:101 [2018-04-11 16:17:29,943 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:29,944 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:29,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 82 [2018-04-11 16:17:29,944 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:29,961 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:29,962 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:29,962 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:29,962 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:29,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 79 [2018-04-11 16:17:29,963 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:29,975 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:29,975 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:148, output treesize:139 [2018-04-11 16:17:30,017 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:30,018 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:30,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 121 [2018-04-11 16:17:30,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:17:30,024 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:30,035 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:30,052 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:30,054 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 36 [2018-04-11 16:17:30,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-04-11 16:17:30,056 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:30,061 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:30,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:30,076 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:165, output treesize:151 [2018-04-11 16:17:30,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 282 treesize of output 174 [2018-04-11 16:17:30,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-04-11 16:17:30,163 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:30,175 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:30,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 60 [2018-04-11 16:17:30,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-04-11 16:17:30,195 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:30,198 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:30,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:30,213 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:294, output treesize:250 [2018-04-11 16:17:30,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 247 treesize of output 136 [2018-04-11 16:17:30,312 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:17:30,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 33 [2018-04-11 16:17:30,313 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:30,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2018-04-11 16:17:30,325 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:30,340 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 7 treesize of output 1 [2018-04-11 16:17:30,340 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:30,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2018-04-11 16:17:30,351 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:30,360 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:30,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-04-11 16:17:30,379 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:17:30,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 16:17:30,379 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:30,383 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 7 treesize of output 1 [2018-04-11 16:17:30,383 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:30,384 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:30,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:30,402 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:274, output treesize:31 [2018-04-11 16:17:30,470 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:17:30,470 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:17:30,470 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-11 16:17:30,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-11 16:17:30,471 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-11 16:17:30,471 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2018-04-11 16:17:30,471 INFO L87 Difference]: Start difference. First operand 325 states and 371 transitions. Second operand 25 states. [2018-04-11 16:17:32,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:17:32,761 INFO L93 Difference]: Finished difference Result 452 states and 507 transitions. [2018-04-11 16:17:32,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-11 16:17:32,761 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 61 [2018-04-11 16:17:32,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:17:32,762 INFO L225 Difference]: With dead ends: 452 [2018-04-11 16:17:32,762 INFO L226 Difference]: Without dead ends: 452 [2018-04-11 16:17:32,763 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=301, Invalid=2149, Unknown=0, NotChecked=0, Total=2450 [2018-04-11 16:17:32,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2018-04-11 16:17:32,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 304. [2018-04-11 16:17:32,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-04-11 16:17:32,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 346 transitions. [2018-04-11 16:17:32,765 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 346 transitions. Word has length 61 [2018-04-11 16:17:32,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:17:32,765 INFO L459 AbstractCegarLoop]: Abstraction has 304 states and 346 transitions. [2018-04-11 16:17:32,765 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-11 16:17:32,765 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 346 transitions. [2018-04-11 16:17:32,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-11 16:17:32,765 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:17:32,765 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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 16:17:32,765 INFO L408 AbstractCegarLoop]: === Iteration 58 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 16:17:32,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1470720829, now seen corresponding path program 6 times [2018-04-11 16:17:32,766 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:17:32,766 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:17:32,766 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:17:32,766 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:17:32,766 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:17:32,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:17:32,775 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:17:32,784 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:17:32,784 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:17:32,784 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:17:32,785 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 16:17:32,816 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-04-11 16:17:32,816 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:17:32,818 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:17:32,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:17:32,863 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:32,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:32,869 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 16:17:32,888 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:32,889 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:32,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-11 16:17:32,889 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:32,895 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 16:17:32,895 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:32,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:32,901 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-04-11 16:17:32,920 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 13 treesize of output 10 [2018-04-11 16:17:32,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:17:32,921 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:32,922 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:32,929 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:32,929 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:38 [2018-04-11 16:17:32,978 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:32,979 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:32,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 40 [2018-04-11 16:17:32,980 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:32,994 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:32,995 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:32,995 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:32,996 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:32,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2018-04-11 16:17:32,996 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:33,008 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:33,009 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:60, output treesize:65 [2018-04-11 16:17:33,052 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:33,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 48 [2018-04-11 16:17:33,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:17:33,056 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:33,062 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:33,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 13 treesize of output 14 [2018-04-11 16:17:33,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 14 treesize of output 13 [2018-04-11 16:17:33,082 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:33,083 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:33,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:33,097 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:93, output treesize:95 [2018-04-11 16:17:33,172 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:33,172 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:33,173 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:33,174 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:33,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 120 [2018-04-11 16:17:33,174 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:33,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 101 [2018-04-11 16:17:33,203 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:33,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:33,226 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:158, output treesize:177 [2018-04-11 16:17:33,315 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:33,316 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:33,320 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:33,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 166 [2018-04-11 16:17:33,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-04-11 16:17:33,323 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:33,344 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:33,370 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:33,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 55 [2018-04-11 16:17:33,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-11 16:17:33,375 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:33,380 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:33,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:33,404 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:200, output treesize:209 [2018-04-11 16:17:33,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 267 treesize of output 207 [2018-04-11 16:17:33,446 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 189 treesize of output 134 [2018-04-11 16:17:33,446 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:33,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-11 16:17:33,458 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:33,467 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:33,484 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 16:17:33,484 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:351, output treesize:211 [2018-04-11 16:17:33,567 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:33,571 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:33,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 220 treesize of output 164 [2018-04-11 16:17:33,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-04-11 16:17:33,576 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:33,591 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:33,607 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 16:17:33,607 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:230, output treesize:212 [2018-04-11 16:17:33,708 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:33,708 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 112 [2018-04-11 16:17:33,708 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:33,724 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:33,726 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:33,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 105 [2018-04-11 16:17:33,730 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2018-04-11 16:17:33,730 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:33,740 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:17:33,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 25 [2018-04-11 16:17:33,740 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:33,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-04-11 16:17:33,748 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:33,754 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:33,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:33,764 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:231, output treesize:45 [2018-04-11 16:17:33,933 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:17:33,933 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:17:33,933 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-04-11 16:17:33,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-11 16:17:33,934 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-11 16:17:33,934 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=629, Unknown=0, NotChecked=0, Total=702 [2018-04-11 16:17:33,934 INFO L87 Difference]: Start difference. First operand 304 states and 346 transitions. Second operand 27 states. [2018-04-11 16:17:37,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:17:37,911 INFO L93 Difference]: Finished difference Result 431 states and 484 transitions. [2018-04-11 16:17:37,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-11 16:17:37,945 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 61 [2018-04-11 16:17:37,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:17:37,946 INFO L225 Difference]: With dead ends: 431 [2018-04-11 16:17:37,946 INFO L226 Difference]: Without dead ends: 431 [2018-04-11 16:17:37,946 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=355, Invalid=2401, Unknown=0, NotChecked=0, Total=2756 [2018-04-11 16:17:37,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-04-11 16:17:37,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 329. [2018-04-11 16:17:37,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-04-11 16:17:37,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 377 transitions. [2018-04-11 16:17:37,948 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 377 transitions. Word has length 61 [2018-04-11 16:17:37,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:17:37,948 INFO L459 AbstractCegarLoop]: Abstraction has 329 states and 377 transitions. [2018-04-11 16:17:37,948 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-11 16:17:37,948 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 377 transitions. [2018-04-11 16:17:37,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-11 16:17:37,949 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:17:37,949 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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 16:17:37,949 INFO L408 AbstractCegarLoop]: === Iteration 59 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 16:17:37,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1470720830, now seen corresponding path program 4 times [2018-04-11 16:17:37,949 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:17:37,949 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:17:37,949 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:17:37,949 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:17:37,949 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:17:37,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:17:37,955 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:17:37,957 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:17:37,957 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:17:37,957 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:17:37,957 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 16:17:37,972 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 16:17:37,972 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:17:37,974 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:17:37,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:17:37,975 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:37,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:37,986 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 16:17:38,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 16:17:38,001 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:38,011 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:38,011 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:38,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 16:17:38,012 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:38,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:38,031 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:32 [2018-04-11 16:17:38,056 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 13 treesize of output 10 [2018-04-11 16:17:38,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:17:38,058 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:38,059 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:38,071 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 13 treesize of output 10 [2018-04-11 16:17:38,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 9 [2018-04-11 16:17:38,073 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:38,074 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:38,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:38,083 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:55, output treesize:56 [2018-04-11 16:17:38,135 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:38,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-11 16:17:38,136 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:38,148 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:38,148 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:38,149 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:38,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 58 [2018-04-11 16:17:38,149 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:38,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:38,159 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:76, output treesize:83 [2018-04-11 16:17:38,195 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:38,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 66 [2018-04-11 16:17:38,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:17:38,199 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:38,206 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:38,221 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:38,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 30 [2018-04-11 16:17:38,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 16:17:38,225 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:38,228 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:38,241 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:38,241 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:114, output treesize:101 [2018-04-11 16:17:38,307 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:38,308 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:38,308 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:38,309 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:38,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 79 [2018-04-11 16:17:38,309 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:38,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 82 [2018-04-11 16:17:38,323 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:38,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:38,334 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:148, output treesize:139 [2018-04-11 16:17:38,376 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:38,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 36 [2018-04-11 16:17:38,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-04-11 16:17:38,380 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:38,384 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:38,402 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:38,403 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:38,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 136 [2018-04-11 16:17:38,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:17:38,409 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:38,421 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:38,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:38,435 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:165, output treesize:151 [2018-04-11 16:17:38,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 60 [2018-04-11 16:17:38,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-04-11 16:17:38,522 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:38,526 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:38,550 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 260 treesize of output 164 [2018-04-11 16:17:38,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-04-11 16:17:38,552 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:38,565 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:38,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:38,585 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:294, output treesize:250 [2018-04-11 16:17:38,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 247 treesize of output 136 [2018-04-11 16:17:38,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-11 16:17:38,702 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:38,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 35 [2018-04-11 16:17:38,716 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:38,731 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:17:38,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 29 [2018-04-11 16:17:38,732 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:38,743 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2018-04-11 16:17:38,743 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:38,753 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:38,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-04-11 16:17:38,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-11 16:17:38,771 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:38,775 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:17:38,775 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 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 16:17:38,775 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:38,777 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:38,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:38,788 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:274, output treesize:31 [2018-04-11 16:17:38,857 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:17:38,857 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:17:38,857 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-11 16:17:38,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-11 16:17:38,858 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-11 16:17:38,858 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2018-04-11 16:17:38,858 INFO L87 Difference]: Start difference. First operand 329 states and 377 transitions. Second operand 25 states. [2018-04-11 16:17:41,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:17:41,135 INFO L93 Difference]: Finished difference Result 463 states and 520 transitions. [2018-04-11 16:17:41,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-11 16:17:41,136 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 61 [2018-04-11 16:17:41,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:17:41,137 INFO L225 Difference]: With dead ends: 463 [2018-04-11 16:17:41,137 INFO L226 Difference]: Without dead ends: 463 [2018-04-11 16:17:41,137 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=301, Invalid=2149, Unknown=0, NotChecked=0, Total=2450 [2018-04-11 16:17:41,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2018-04-11 16:17:41,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 315. [2018-04-11 16:17:41,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-04-11 16:17:41,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 359 transitions. [2018-04-11 16:17:41,140 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 359 transitions. Word has length 61 [2018-04-11 16:17:41,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:17:41,141 INFO L459 AbstractCegarLoop]: Abstraction has 315 states and 359 transitions. [2018-04-11 16:17:41,141 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-11 16:17:41,141 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 359 transitions. [2018-04-11 16:17:41,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-11 16:17:41,141 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:17:41,141 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:17:41,141 INFO L408 AbstractCegarLoop]: === Iteration 60 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 16:17:41,142 INFO L82 PathProgramCache]: Analyzing trace with hash 625390998, now seen corresponding path program 1 times [2018-04-11 16:17:41,142 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:17:41,142 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:17:41,142 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:17:41,142 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:17:41,142 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:17:41,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:17:41,149 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:17:41,151 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:17:41,151 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:17:41,151 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:17:41,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:17:41,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:17:41,166 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:17:41,229 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 13 treesize of output 10 [2018-04-11 16:17:41,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 9 [2018-04-11 16:17:41,230 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:41,232 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:41,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:41,239 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:44 [2018-04-11 16:17:41,284 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:41,287 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 59 [2018-04-11 16:17:41,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 16:17:41,289 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:41,293 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:41,299 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 16:17:41,299 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:66, output treesize:56 [2018-04-11 16:17:41,347 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:41,347 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 55 [2018-04-11 16:17:41,351 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 7 treesize of output 1 [2018-04-11 16:17:41,351 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:41,359 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 30 [2018-04-11 16:17:41,359 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 16:17:41,366 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 16:17:41,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 16:17:41,376 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:65, output treesize:56 [2018-04-11 16:17:41,445 WARN L1033 $PredicateComparison]: unable to prove that (exists ((main_~p~0.base Int)) (let ((.cse0 (store |c_old(#valid)| main_~p~0.base 1))) (and (= 0 (select |c_old(#valid)| main_~p~0.base)) (= |c_#valid| (store (store .cse0 c_main_~t~0.base 1) main_~p~0.base 0)) (= (select .cse0 c_main_~t~0.base) 0)))) is different from true [2018-04-11 16:17:41,447 WARN L1033 $PredicateComparison]: unable to prove that (exists ((v_subst_44 Int)) (let ((.cse0 (store |c_old(#valid)| v_subst_44 1))) (and (= 0 (select .cse0 c_main_~p~0.base)) (= |c_#valid| (store (store .cse0 c_main_~p~0.base 1) v_subst_44 0)) (= 0 (select |c_old(#valid)| v_subst_44))))) is different from true [2018-04-11 16:17:41,450 WARN L1033 $PredicateComparison]: unable to prove that (exists ((main_~p~0.base Int) (v_subst_44 Int)) (let ((.cse0 (store |c_old(#valid)| v_subst_44 1))) (and (= 0 (select .cse0 main_~p~0.base)) (= (store (store (store .cse0 main_~p~0.base 1) v_subst_44 0) main_~p~0.base 0) |c_#valid|) (= 0 (select |c_old(#valid)| v_subst_44))))) is different from true [2018-04-11 16:17:41,462 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 3 not checked. [2018-04-11 16:17:41,462 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:17:41,463 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-11 16:17:41,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 16:17:41,463 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 16:17:41,463 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=240, Unknown=3, NotChecked=96, Total=380 [2018-04-11 16:17:41,463 INFO L87 Difference]: Start difference. First operand 315 states and 359 transitions. Second operand 20 states. [2018-04-11 16:17:42,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:17:42,094 INFO L93 Difference]: Finished difference Result 338 states and 382 transitions. [2018-04-11 16:17:42,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 16:17:42,094 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 63 [2018-04-11 16:17:42,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:17:42,095 INFO L225 Difference]: With dead ends: 338 [2018-04-11 16:17:42,095 INFO L226 Difference]: Without dead ends: 333 [2018-04-11 16:17:42,095 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=654, Unknown=3, NotChecked=162, Total=930 [2018-04-11 16:17:42,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-04-11 16:17:42,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 330. [2018-04-11 16:17:42,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-04-11 16:17:42,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 374 transitions. [2018-04-11 16:17:42,097 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 374 transitions. Word has length 63 [2018-04-11 16:17:42,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:17:42,097 INFO L459 AbstractCegarLoop]: Abstraction has 330 states and 374 transitions. [2018-04-11 16:17:42,097 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 16:17:42,097 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 374 transitions. [2018-04-11 16:17:42,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-11 16:17:42,097 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:17:42,097 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 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 16:17:42,097 INFO L408 AbstractCegarLoop]: === Iteration 61 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 16:17:42,098 INFO L82 PathProgramCache]: Analyzing trace with hash 539887239, now seen corresponding path program 5 times [2018-04-11 16:17:42,098 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:17:42,098 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:17:42,098 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:17:42,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:17:42,098 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:17:42,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:17:42,104 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:17:42,106 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:17:42,106 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:17:42,106 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:17:42,106 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 16:17:42,123 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-04-11 16:17:42,123 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:17:42,125 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:17:42,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:17:42,127 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:42,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:42,129 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 16:17:42,149 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:42,149 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 16:17:42,149 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:42,162 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:42,162 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:42,164 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:42,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2018-04-11 16:17:42,164 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:42,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:42,173 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:37 [2018-04-11 16:17:42,198 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 13 treesize of output 10 [2018-04-11 16:17:42,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:17:42,199 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:42,200 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:42,213 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 13 treesize of output 10 [2018-04-11 16:17:42,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 9 [2018-04-11 16:17:42,214 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:42,215 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:42,225 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:42,225 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:72, output treesize:68 [2018-04-11 16:17:42,292 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:42,292 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:42,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 53 [2018-04-11 16:17:42,293 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:42,309 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:42,310 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:42,310 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:42,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-04-11 16:17:42,311 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:42,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:42,323 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:97, output treesize:89 [2018-04-11 16:17:42,362 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:42,364 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:42,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 66 [2018-04-11 16:17:42,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-04-11 16:17:42,366 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:42,372 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:42,388 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:42,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-04-11 16:17:42,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 16:17:42,392 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:42,396 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:42,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:42,411 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:115, output treesize:97 [2018-04-11 16:17:42,482 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 11 treesize of output 20 [2018-04-11 16:17:42,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-11 16:17:42,484 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:42,485 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:42,500 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 16:17:42,501 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:135, output treesize:143 [2018-04-11 16:17:42,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 57 [2018-04-11 16:17:42,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-04-11 16:17:42,534 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:42,538 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:42,560 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:42,561 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:42,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 136 [2018-04-11 16:17:42,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-04-11 16:17:42,565 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:42,575 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:42,593 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:42,593 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:221, output treesize:189 [2018-04-11 16:17:42,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 16:17:42,680 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:42,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2018-04-11 16:17:42,704 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:17:42,705 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 0 case distinctions, treesize of input 20 treesize of output 12 [2018-04-11 16:17:42,705 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:42,710 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 7 treesize of output 1 [2018-04-11 16:17:42,710 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:42,713 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:42,731 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:42,731 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:205, output treesize:160 [2018-04-11 16:17:42,788 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:42,789 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:42,789 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:42,789 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:17:42,792 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:42,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 124 [2018-04-11 16:17:42,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-11 16:17:42,793 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:42,811 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:17:42,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-04-11 16:17:42,811 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:42,820 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:17:42,820 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 53 treesize of output 33 [2018-04-11 16:17:42,821 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:42,827 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:42,838 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:42,839 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:161, output treesize:50 [2018-04-11 16:17:42,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 16:17:42,901 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 12 [2018-04-11 16:17:42,901 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 16:17:42,903 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 16:17:42,914 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-04-11 16:17:42,914 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:60, output treesize:94 [2018-04-11 16:17:43,021 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:17:43,021 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:17:43,022 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-04-11 16:17:43,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-11 16:17:43,022 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-11 16:17:43,022 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=575, Unknown=1, NotChecked=0, Total=650 [2018-04-11 16:17:43,022 INFO L87 Difference]: Start difference. First operand 330 states and 374 transitions. Second operand 26 states. [2018-04-11 16:17:45,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:17:45,430 INFO L93 Difference]: Finished difference Result 426 states and 473 transitions. [2018-04-11 16:17:45,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-11 16:17:45,430 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 63 [2018-04-11 16:17:45,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:17:45,431 INFO L225 Difference]: With dead ends: 426 [2018-04-11 16:17:45,431 INFO L226 Difference]: Without dead ends: 425 [2018-04-11 16:17:45,432 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=341, Invalid=2309, Unknown=2, NotChecked=0, Total=2652 [2018-04-11 16:17:45,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2018-04-11 16:17:45,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 330. [2018-04-11 16:17:45,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-04-11 16:17:45,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 374 transitions. [2018-04-11 16:17:45,434 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 374 transitions. Word has length 63 [2018-04-11 16:17:45,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:17:45,434 INFO L459 AbstractCegarLoop]: Abstraction has 330 states and 374 transitions. [2018-04-11 16:17:45,434 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-11 16:17:45,434 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 374 transitions. [2018-04-11 16:17:45,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-11 16:17:45,434 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:17:45,434 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:17:45,434 INFO L408 AbstractCegarLoop]: === Iteration 62 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 16:17:45,435 INFO L82 PathProgramCache]: Analyzing trace with hash -445661091, now seen corresponding path program 1 times [2018-04-11 16:17:45,435 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:17:45,435 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:17:45,435 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:17:45,435 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:17:45,435 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:17:45,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:17:45,441 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:17:45,443 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:17:45,443 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:17:45,443 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:17:45,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:17:45,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:17:45,455 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:17:45,497 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 13 treesize of output 10 [2018-04-11 16:17:45,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 9 [2018-04-11 16:17:45,498 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:45,499 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:45,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:45,505 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:44 [2018-04-11 16:17:45,548 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:45,550 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 59 [2018-04-11 16:17:45,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 16:17:45,551 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:45,555 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:45,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 16:17:45,561 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:66, output treesize:56 [2018-04-11 16:17:45,600 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:45,601 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 55 [2018-04-11 16:17:45,602 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 7 treesize of output 1 [2018-04-11 16:17:45,603 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:45,610 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 30 [2018-04-11 16:17:45,610 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 16:17:45,617 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 16:17:45,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 16:17:45,626 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:65, output treesize:56 [2018-04-11 16:17:45,700 WARN L1033 $PredicateComparison]: unable to prove that (exists ((main_~p~0.base Int)) (let ((.cse0 (store |c_old(#valid)| main_~p~0.base 1))) (and (= 0 (select |c_old(#valid)| main_~p~0.base)) (= |c_#valid| (store (store .cse0 c_main_~t~0.base 1) main_~p~0.base 0)) (= (select .cse0 c_main_~t~0.base) 0)))) is different from true [2018-04-11 16:17:45,701 WARN L1033 $PredicateComparison]: unable to prove that (exists ((v_subst_46 Int)) (let ((.cse0 (store |c_old(#valid)| v_subst_46 1))) (and (= 0 (select .cse0 c_main_~p~0.base)) (= (store (store .cse0 c_main_~p~0.base 1) v_subst_46 0) |c_#valid|) (= 0 (select |c_old(#valid)| v_subst_46))))) is different from true [2018-04-11 16:17:45,703 WARN L1033 $PredicateComparison]: unable to prove that (exists ((v_subst_46 Int) (main_~p~0.base Int)) (let ((.cse0 (store |c_old(#valid)| v_subst_46 1))) (and (= 0 (select .cse0 main_~p~0.base)) (= 0 (select |c_old(#valid)| v_subst_46)) (= |c_#valid| (store (store (store .cse0 main_~p~0.base 1) v_subst_46 0) main_~p~0.base 0))))) is different from true [2018-04-11 16:17:45,717 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 3 not checked. [2018-04-11 16:17:45,717 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:17:45,718 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-11 16:17:45,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 16:17:45,718 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 16:17:45,718 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=240, Unknown=3, NotChecked=96, Total=380 [2018-04-11 16:17:45,718 INFO L87 Difference]: Start difference. First operand 330 states and 374 transitions. Second operand 20 states. [2018-04-11 16:17:46,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:17:46,393 INFO L93 Difference]: Finished difference Result 338 states and 382 transitions. [2018-04-11 16:17:46,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 16:17:46,393 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 63 [2018-04-11 16:17:46,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:17:46,393 INFO L225 Difference]: With dead ends: 338 [2018-04-11 16:17:46,394 INFO L226 Difference]: Without dead ends: 333 [2018-04-11 16:17:46,394 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=654, Unknown=3, NotChecked=162, Total=930 [2018-04-11 16:17:46,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-04-11 16:17:46,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 315. [2018-04-11 16:17:46,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-04-11 16:17:46,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 359 transitions. [2018-04-11 16:17:46,395 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 359 transitions. Word has length 63 [2018-04-11 16:17:46,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:17:46,395 INFO L459 AbstractCegarLoop]: Abstraction has 315 states and 359 transitions. [2018-04-11 16:17:46,396 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 16:17:46,396 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 359 transitions. [2018-04-11 16:17:46,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-11 16:17:46,396 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:17:46,396 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:17:46,396 INFO L408 AbstractCegarLoop]: === Iteration 63 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 16:17:46,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1604729402, now seen corresponding path program 1 times [2018-04-11 16:17:46,396 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:17:46,396 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:17:46,397 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:17:46,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:17:46,397 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:17:46,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:17:46,401 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:17:46,404 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:17:46,404 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:17:46,404 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:17:46,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:17:46,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:17:46,415 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:17:46,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 16:17:46,427 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:46,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:17:46,437 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:46,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:46,439 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:11 [2018-04-11 16:17:46,457 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:46,458 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 16:17:46,458 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:46,464 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:46,465 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:46,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 16:17:46,465 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:46,471 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:46,471 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:31 [2018-04-11 16:17:46,490 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 13 treesize of output 10 [2018-04-11 16:17:46,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:17:46,491 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:46,492 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:46,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:46,499 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:56 [2018-04-11 16:17:46,547 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:46,548 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:46,548 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:46,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-04-11 16:17:46,548 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:46,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 14 [2018-04-11 16:17:46,555 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:46,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:46,560 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:67, output treesize:40 [2018-04-11 16:17:46,579 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:46,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 44 [2018-04-11 16:17:46,582 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:17:46,582 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:46,587 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:46,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:46,594 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:57 [2018-04-11 16:17:46,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 76 [2018-04-11 16:17:46,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-04-11 16:17:46,639 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:46,644 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:46,650 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 16:17:46,650 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:103, output treesize:87 [2018-04-11 16:17:46,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 66 [2018-04-11 16:17:46,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-11 16:17:46,690 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:46,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-04-11 16:17:46,695 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:46,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 22 [2018-04-11 16:17:46,701 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 16:17:46,706 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 16:17:46,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 16:17:46,713 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:96, output treesize:30 [2018-04-11 16:17:46,781 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:46,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-11 16:17:46,781 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:46,784 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:46,784 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-04-11 16:17:46,831 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:17:46,831 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:17:46,831 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-11 16:17:46,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 16:17:46,831 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 16:17:46,831 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2018-04-11 16:17:46,832 INFO L87 Difference]: Start difference. First operand 315 states and 359 transitions. Second operand 23 states. [2018-04-11 16:17:48,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:17:48,123 INFO L93 Difference]: Finished difference Result 376 states and 419 transitions. [2018-04-11 16:17:48,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 16:17:48,124 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 63 [2018-04-11 16:17:48,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:17:48,124 INFO L225 Difference]: With dead ends: 376 [2018-04-11 16:17:48,124 INFO L226 Difference]: Without dead ends: 376 [2018-04-11 16:17:48,125 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=288, Invalid=1782, Unknown=0, NotChecked=0, Total=2070 [2018-04-11 16:17:48,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2018-04-11 16:17:48,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 326. [2018-04-11 16:17:48,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-04-11 16:17:48,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 371 transitions. [2018-04-11 16:17:48,126 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 371 transitions. Word has length 63 [2018-04-11 16:17:48,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:17:48,127 INFO L459 AbstractCegarLoop]: Abstraction has 326 states and 371 transitions. [2018-04-11 16:17:48,127 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 16:17:48,127 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 371 transitions. [2018-04-11 16:17:48,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-11 16:17:48,127 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:17:48,127 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:17:48,127 INFO L408 AbstractCegarLoop]: === Iteration 64 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 16:17:48,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1604729401, now seen corresponding path program 1 times [2018-04-11 16:17:48,127 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:17:48,127 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:17:48,128 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:17:48,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:17:48,128 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:17:48,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:17:48,132 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:17:48,134 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:17:48,134 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:17:48,134 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:17:48,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:17:48,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:17:48,147 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:17:48,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:17:48,148 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:48,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:48,151 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 16:17:48,162 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 11 treesize of output 8 [2018-04-11 16:17:48,163 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 16:17:48,163 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:48,164 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:48,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:48,169 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:25 [2018-04-11 16:17:48,180 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:48,180 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:48,181 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-11 16:17:48,181 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:48,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:48,187 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:34 [2018-04-11 16:17:48,208 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 13 treesize of output 10 [2018-04-11 16:17:48,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:17:48,209 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:48,210 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:48,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:48,217 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:46 [2018-04-11 16:17:48,257 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:48,259 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 19 treesize of output 26 [2018-04-11 16:17:48,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 16:17:48,261 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:48,264 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:48,273 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 16:17:48,273 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:68, output treesize:65 [2018-04-11 16:17:48,287 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:48,288 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:48,288 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:48,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 32 [2018-04-11 16:17:48,289 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:48,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:48,297 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:70, output treesize:63 [2018-04-11 16:17:48,323 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:48,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 57 [2018-04-11 16:17:48,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:17:48,327 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:48,332 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:48,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:48,342 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:76, output treesize:75 [2018-04-11 16:17:48,361 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 54 [2018-04-11 16:17:48,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 13 [2018-04-11 16:17:48,362 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:48,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2018-04-11 16:17:48,367 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:48,371 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:48,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:48,377 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:93, output treesize:36 [2018-04-11 16:17:48,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2018-04-11 16:17:48,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 16:17:48,416 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:48,420 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:48,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:48,428 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:47, output treesize:43 [2018-04-11 16:17:48,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2018-04-11 16:17:48,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 16:17:48,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:48,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 16:17:48,505 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:48,508 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:17:48,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-11 16:17:48,508 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:48,510 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:48,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:48,516 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:53, output treesize:3 [2018-04-11 16:17:48,541 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-11 16:17:48,541 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:17:48,541 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-11 16:17:48,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-11 16:17:48,541 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-11 16:17:48,541 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2018-04-11 16:17:48,541 INFO L87 Difference]: Start difference. First operand 326 states and 371 transitions. Second operand 21 states. [2018-04-11 16:17:49,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:17:49,768 INFO L93 Difference]: Finished difference Result 382 states and 424 transitions. [2018-04-11 16:17:49,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-11 16:17:49,768 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 63 [2018-04-11 16:17:49,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:17:49,769 INFO L225 Difference]: With dead ends: 382 [2018-04-11 16:17:49,769 INFO L226 Difference]: Without dead ends: 377 [2018-04-11 16:17:49,769 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=260, Invalid=1380, Unknown=0, NotChecked=0, Total=1640 [2018-04-11 16:17:49,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2018-04-11 16:17:49,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 323. [2018-04-11 16:17:49,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-04-11 16:17:49,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 367 transitions. [2018-04-11 16:17:49,771 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 367 transitions. Word has length 63 [2018-04-11 16:17:49,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:17:49,771 INFO L459 AbstractCegarLoop]: Abstraction has 323 states and 367 transitions. [2018-04-11 16:17:49,771 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-11 16:17:49,771 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 367 transitions. [2018-04-11 16:17:49,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-11 16:17:49,771 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:17:49,771 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:17:49,771 INFO L408 AbstractCegarLoop]: === Iteration 65 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 16:17:49,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1175043252, now seen corresponding path program 2 times [2018-04-11 16:17:49,771 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:17:49,772 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:17:49,772 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:17:49,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:17:49,772 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:17:49,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:17:49,776 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:17:49,785 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:17:49,785 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:17:49,785 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:17:49,785 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 16:17:49,807 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 16:17:49,807 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:17:49,809 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:17:49,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:17:49,811 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:49,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:49,813 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 16:17:49,825 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:49,826 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:49,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-11 16:17:49,826 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:49,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 16:17:49,833 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:49,838 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:49,839 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:32 [2018-04-11 16:17:49,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 16:17:49,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:17:49,860 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:49,861 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:49,872 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 13 treesize of output 10 [2018-04-11 16:17:49,873 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 9 [2018-04-11 16:17:49,873 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:49,874 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:49,883 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:49,883 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:58, output treesize:56 [2018-04-11 16:17:49,949 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:49,949 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-11 16:17:49,949 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:49,963 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:49,964 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:49,965 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:49,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 32 [2018-04-11 16:17:49,966 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:49,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:49,976 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:85, output treesize:77 [2018-04-11 16:17:50,013 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:50,015 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:50,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 66 [2018-04-11 16:17:50,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-04-11 16:17:50,017 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:50,024 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:50,037 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:50,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-04-11 16:17:50,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 16:17:50,041 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:50,045 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:50,057 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:50,057 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:100, output treesize:97 [2018-04-11 16:17:50,124 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 11 treesize of output 20 [2018-04-11 16:17:50,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-04-11 16:17:50,126 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:50,127 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:50,141 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 16:17:50,141 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:150, output treesize:167 [2018-04-11 16:17:50,169 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:50,170 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:50,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 211 treesize of output 184 [2018-04-11 16:17:50,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 33 [2018-04-11 16:17:50,177 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:50,189 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:50,206 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:50,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 180 [2018-04-11 16:17:50,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-04-11 16:17:50,213 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:50,224 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:50,238 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:50,238 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:235, output treesize:203 [2018-04-11 16:17:50,453 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:50,453 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:17:50,453 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 0 case distinctions, treesize of input 38 treesize of output 55 [2018-04-11 16:17:50,453 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:50,476 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:50,477 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:50,478 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:50,478 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:17:50,480 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:50,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 158 [2018-04-11 16:17:50,484 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:17:50,488 INFO L477 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 129 treesize of output 101 [2018-04-11 16:17:50,489 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-11 16:17:50,514 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 86 treesize of output 73 [2018-04-11 16:17:50,515 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:50,516 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 80 treesize of output 67 [2018-04-11 16:17:50,516 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:50,539 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:17:50,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 80 [2018-04-11 16:17:50,544 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-11 16:17:50,545 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:17:50,546 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 82 treesize of output 66 [2018-04-11 16:17:50,546 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:50,571 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 16:17:50,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 59 [2018-04-11 16:17:50,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-04-11 16:17:50,602 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:50,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-11 16:17:50,618 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:50,625 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:17:50,625 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 0 case distinctions, treesize of input 26 treesize of output 18 [2018-04-11 16:17:50,625 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:50,630 INFO L267 ElimStorePlain]: Start of recursive call 9: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:50,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 59 [2018-04-11 16:17:50,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-11 16:17:50,635 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:50,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-04-11 16:17:50,643 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:50,650 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:17:50,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-04-11 16:17:50,651 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:50,656 INFO L267 ElimStorePlain]: Start of recursive call 13: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:50,672 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:50,672 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 7 variables, input treesize:224, output treesize:11 [2018-04-11 16:17:50,716 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 15 treesize of output 11 [2018-04-11 16:17:50,716 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:17:50,717 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 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-11 16:17:50,717 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:50,718 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:50,720 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:50,720 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:3 [2018-04-11 16:17:50,757 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:17:50,758 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:17:50,758 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-04-11 16:17:50,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-11 16:17:50,758 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-11 16:17:50,758 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=586, Unknown=0, NotChecked=0, Total=650 [2018-04-11 16:17:50,758 INFO L87 Difference]: Start difference. First operand 323 states and 367 transitions. Second operand 26 states. [2018-04-11 16:17:52,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:17:52,899 INFO L93 Difference]: Finished difference Result 369 states and 409 transitions. [2018-04-11 16:17:52,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-11 16:17:52,899 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 63 [2018-04-11 16:17:52,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:17:52,900 INFO L225 Difference]: With dead ends: 369 [2018-04-11 16:17:52,900 INFO L226 Difference]: Without dead ends: 369 [2018-04-11 16:17:52,900 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=303, Invalid=2247, Unknown=0, NotChecked=0, Total=2550 [2018-04-11 16:17:52,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-04-11 16:17:52,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 316. [2018-04-11 16:17:52,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-04-11 16:17:52,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 354 transitions. [2018-04-11 16:17:52,902 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 354 transitions. Word has length 63 [2018-04-11 16:17:52,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:17:52,902 INFO L459 AbstractCegarLoop]: Abstraction has 316 states and 354 transitions. [2018-04-11 16:17:52,902 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-11 16:17:52,903 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 354 transitions. [2018-04-11 16:17:52,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-11 16:17:52,903 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:17:52,903 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:17:52,903 INFO L408 AbstractCegarLoop]: === Iteration 66 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 16:17:52,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1271703833, now seen corresponding path program 3 times [2018-04-11 16:17:52,903 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:17:52,903 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:17:52,904 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:17:52,904 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:17:52,904 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:17:52,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:17:52,908 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:17:52,922 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:17:52,923 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:17:52,923 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:17:52,923 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 16:17:52,936 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-04-11 16:17:52,936 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:17:52,938 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:17:52,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:17:52,939 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:52,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:52,941 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 16:17:52,954 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:52,955 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:52,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 16:17:52,955 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:52,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:52,961 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-04-11 16:17:52,979 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 13 treesize of output 10 [2018-04-11 16:17:52,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:17:52,980 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:52,981 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:52,989 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 13 treesize of output 10 [2018-04-11 16:17:52,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 9 [2018-04-11 16:17:52,990 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:52,991 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:52,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:52,997 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:45 [2018-04-11 16:17:53,030 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:53,030 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:53,031 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:53,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 32 [2018-04-11 16:17:53,031 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:53,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:53,037 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:65, output treesize:58 [2018-04-11 16:17:53,061 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:53,063 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:53,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 55 [2018-04-11 16:17:53,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-04-11 16:17:53,064 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:53,070 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:53,079 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:53,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-04-11 16:17:53,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 16 treesize of output 15 [2018-04-11 16:17:53,082 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:53,086 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:53,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:53,093 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:81, output treesize:72 [2018-04-11 16:17:53,143 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 11 treesize of output 26 [2018-04-11 16:17:53,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 43 [2018-04-11 16:17:53,144 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:53,146 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:53,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:53,155 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:140, output treesize:169 [2018-04-11 16:17:53,177 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:53,179 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:53,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 249 treesize of output 222 [2018-04-11 16:17:53,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2018-04-11 16:17:53,185 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:53,195 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:53,206 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:53,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 236 treesize of output 228 [2018-04-11 16:17:53,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2018-04-11 16:17:53,212 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:53,220 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:53,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:53,229 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:261, output treesize:217 [2018-04-11 16:17:53,379 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:53,380 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:53,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 201 treesize of output 158 [2018-04-11 16:17:53,382 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 19 treesize of output 1 [2018-04-11 16:17:53,382 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:53,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 95 [2018-04-11 16:17:53,392 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:53,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 45 [2018-04-11 16:17:53,401 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:53,407 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:53,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 62 [2018-04-11 16:17:53,418 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 50 treesize of output 29 [2018-04-11 16:17:53,418 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:53,424 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 29 treesize of output 16 [2018-04-11 16:17:53,424 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:53,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 16:17:53,428 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:53,429 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:53,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:53,433 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:208, output treesize:11 [2018-04-11 16:17:53,482 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 15 treesize of output 11 [2018-04-11 16:17:53,483 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:17:53,483 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 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-11 16:17:53,484 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:53,485 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:53,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:53,487 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:3 [2018-04-11 16:17:53,514 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:17:53,514 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:17:53,514 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-11 16:17:53,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-11 16:17:53,514 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-11 16:17:53,515 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=494, Unknown=0, NotChecked=0, Total=552 [2018-04-11 16:17:53,515 INFO L87 Difference]: Start difference. First operand 316 states and 354 transitions. Second operand 24 states. [2018-04-11 16:17:55,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:17:55,191 INFO L93 Difference]: Finished difference Result 393 states and 433 transitions. [2018-04-11 16:17:55,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-11 16:17:55,191 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 63 [2018-04-11 16:17:55,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:17:55,192 INFO L225 Difference]: With dead ends: 393 [2018-04-11 16:17:55,192 INFO L226 Difference]: Without dead ends: 393 [2018-04-11 16:17:55,192 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=280, Invalid=1976, Unknown=0, NotChecked=0, Total=2256 [2018-04-11 16:17:55,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2018-04-11 16:17:55,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 319. [2018-04-11 16:17:55,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-04-11 16:17:55,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 357 transitions. [2018-04-11 16:17:55,194 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 357 transitions. Word has length 63 [2018-04-11 16:17:55,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:17:55,194 INFO L459 AbstractCegarLoop]: Abstraction has 319 states and 357 transitions. [2018-04-11 16:17:55,194 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-11 16:17:55,194 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 357 transitions. [2018-04-11 16:17:55,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-04-11 16:17:55,195 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:17:55,195 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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 16:17:55,195 INFO L408 AbstractCegarLoop]: === Iteration 67 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 16:17:55,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1759868103, now seen corresponding path program 6 times [2018-04-11 16:17:55,195 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:17:55,195 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:17:55,195 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:17:55,195 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:17:55,195 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:17:55,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:17:55,200 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:17:55,203 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:17:55,203 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:17:55,203 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:17:55,203 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 16:17:55,216 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-04-11 16:17:55,216 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:17:55,218 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:17:55,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:17:55,220 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:55,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:55,222 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 16:17:55,239 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:55,240 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:55,240 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 16:17:55,240 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:55,246 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 16:17:55,246 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:55,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:55,253 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:24 [2018-04-11 16:17:55,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 8 [2018-04-11 16:17:55,272 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:55,289 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 13 treesize of output 10 [2018-04-11 16:17:55,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:17:55,290 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:55,291 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:55,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:55,297 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:49, output treesize:28 [2018-04-11 16:17:55,340 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:55,341 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:55,341 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:55,342 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:55,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 46 [2018-04-11 16:17:55,342 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:55,353 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:55,353 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:50, output treesize:58 [2018-04-11 16:17:55,388 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:55,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 45 [2018-04-11 16:17:55,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:17:55,391 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:55,395 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:55,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:55,405 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:76, output treesize:70 [2018-04-11 16:17:55,479 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:55,479 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:55,511 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:55,512 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:55,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 129 [2018-04-11 16:17:55,513 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:55,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:55,529 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:120, output treesize:144 [2018-04-11 16:17:55,580 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 13 treesize of output 22 [2018-04-11 16:17:55,582 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-04-11 16:17:55,582 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:55,584 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:55,603 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:55,604 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:55,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 136 [2018-04-11 16:17:55,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:17:55,610 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:55,621 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:55,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:55,639 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:167, output treesize:186 [2018-04-11 16:17:55,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 15 [2018-04-11 16:17:55,679 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 15 treesize of output 3 [2018-04-11 16:17:55,679 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:55,680 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:55,695 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 16:17:55,695 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:261, output treesize:222 [2018-04-11 16:17:55,759 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 231 treesize of output 147 [2018-04-11 16:17:55,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-04-11 16:17:55,760 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:55,772 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:55,786 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 16:17:55,786 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:245, output treesize:223 [2018-04-11 16:17:55,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 218 treesize of output 121 [2018-04-11 16:17:55,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 26 [2018-04-11 16:17:55,890 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:55,899 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:17:55,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 29 [2018-04-11 16:17:55,900 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:55,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2018-04-11 16:17:55,909 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:55,915 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:55,925 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:55,926 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:235, output treesize:45 [2018-04-11 16:17:56,004 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:17:56,005 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:17:56,005 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-04-11 16:17:56,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-11 16:17:56,005 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-11 16:17:56,005 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2018-04-11 16:17:56,005 INFO L87 Difference]: Start difference. First operand 319 states and 357 transitions. Second operand 27 states. [2018-04-11 16:17:57,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:17:57,523 INFO L93 Difference]: Finished difference Result 384 states and 426 transitions. [2018-04-11 16:17:57,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-11 16:17:57,524 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 64 [2018-04-11 16:17:57,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:17:57,524 INFO L225 Difference]: With dead ends: 384 [2018-04-11 16:17:57,525 INFO L226 Difference]: Without dead ends: 384 [2018-04-11 16:17:57,525 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 596 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=345, Invalid=2307, Unknown=0, NotChecked=0, Total=2652 [2018-04-11 16:17:57,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2018-04-11 16:17:57,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 324. [2018-04-11 16:17:57,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2018-04-11 16:17:57,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 363 transitions. [2018-04-11 16:17:57,526 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 363 transitions. Word has length 64 [2018-04-11 16:17:57,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:17:57,527 INFO L459 AbstractCegarLoop]: Abstraction has 324 states and 363 transitions. [2018-04-11 16:17:57,527 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-11 16:17:57,527 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 363 transitions. [2018-04-11 16:17:57,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-04-11 16:17:57,527 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:17:57,527 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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 16:17:57,527 INFO L408 AbstractCegarLoop]: === Iteration 68 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 16:17:57,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1759868102, now seen corresponding path program 4 times [2018-04-11 16:17:57,527 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:17:57,527 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:17:57,528 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:17:57,528 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:17:57,528 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:17:57,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:17:57,533 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:17:57,539 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:17:57,540 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:17:57,540 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:17:57,540 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 16:17:57,555 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 16:17:57,556 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:17:57,557 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:17:57,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:17:57,564 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:57,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:57,566 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 16:17:57,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:17:57,602 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:57,610 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:57,611 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:57,611 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 16:17:57,611 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:57,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:57,618 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:25 [2018-04-11 16:17:57,641 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 13 treesize of output 10 [2018-04-11 16:17:57,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:17:57,642 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:57,644 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:57,656 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 13 treesize of output 10 [2018-04-11 16:17:57,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 9 [2018-04-11 16:17:57,657 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:57,659 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:57,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:57,668 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:53, output treesize:48 [2018-04-11 16:17:57,721 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:57,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-11 16:17:57,722 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:57,736 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:57,737 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:57,737 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:57,738 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:57,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 46 [2018-04-11 16:17:57,738 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:57,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:57,753 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:76, output treesize:83 [2018-04-11 16:17:57,797 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:57,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 56 [2018-04-11 16:17:57,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:17:57,801 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:57,806 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:57,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 30 [2018-04-11 16:17:57,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 16 treesize of output 15 [2018-04-11 16:17:57,825 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:57,829 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:57,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:57,845 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:114, output treesize:95 [2018-04-11 16:17:57,919 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:57,919 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:57,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 82 [2018-04-11 16:17:57,920 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:57,939 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:57,940 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:57,940 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:57,941 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:57,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 79 [2018-04-11 16:17:57,941 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:57,955 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:57,955 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:154, output treesize:145 [2018-04-11 16:17:58,001 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:58,001 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:58,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 121 [2018-04-11 16:17:58,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:17:58,008 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:58,019 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:58,039 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:17:58,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 36 [2018-04-11 16:17:58,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-04-11 16:17:58,042 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:58,046 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:58,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:58,067 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:171, output treesize:157 [2018-04-11 16:17:58,163 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 282 treesize of output 174 [2018-04-11 16:17:58,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-04-11 16:17:58,165 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:58,179 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:58,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 60 [2018-04-11 16:17:58,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-04-11 16:17:58,203 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:58,207 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:58,224 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:58,225 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:300, output treesize:256 [2018-04-11 16:17:58,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 247 treesize of output 136 [2018-04-11 16:17:58,314 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 7 treesize of output 1 [2018-04-11 16:17:58,314 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:58,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 35 [2018-04-11 16:17:58,328 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:58,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2018-04-11 16:17:58,340 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:58,352 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:17:58,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2018-04-11 16:17:58,353 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:58,362 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:58,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 5 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 16:17:58,381 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:17:58,381 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 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 16:17:58,381 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:58,386 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 7 treesize of output 1 [2018-04-11 16:17:58,386 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 16:17:58,387 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:17:58,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 16:17:58,398 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:274, output treesize:31 [2018-04-11 16:17:58,472 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:17:58,472 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:17:58,472 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-04-11 16:17:58,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-11 16:17:58,472 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-11 16:17:58,472 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=580, Unknown=0, NotChecked=0, Total=650 [2018-04-11 16:17:58,472 INFO L87 Difference]: Start difference. First operand 324 states and 363 transitions. Second operand 26 states. [2018-04-11 16:18:00,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:18:00,640 INFO L93 Difference]: Finished difference Result 416 states and 460 transitions. [2018-04-11 16:18:00,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-11 16:18:00,641 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 64 [2018-04-11 16:18:00,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:18:00,641 INFO L225 Difference]: With dead ends: 416 [2018-04-11 16:18:00,641 INFO L226 Difference]: Without dead ends: 416 [2018-04-11 16:18:00,642 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=333, Invalid=2319, Unknown=0, NotChecked=0, Total=2652 [2018-04-11 16:18:00,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2018-04-11 16:18:00,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 324. [2018-04-11 16:18:00,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2018-04-11 16:18:00,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 363 transitions. [2018-04-11 16:18:00,643 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 363 transitions. Word has length 64 [2018-04-11 16:18:00,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:18:00,644 INFO L459 AbstractCegarLoop]: Abstraction has 324 states and 363 transitions. [2018-04-11 16:18:00,644 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-11 16:18:00,644 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 363 transitions. [2018-04-11 16:18:00,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-04-11 16:18:00,644 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:18:00,644 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:18:00,644 INFO L408 AbstractCegarLoop]: === Iteration 69 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 16:18:00,644 INFO L82 PathProgramCache]: Analyzing trace with hash 881976335, now seen corresponding path program 2 times [2018-04-11 16:18:00,644 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:18:00,644 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:18:00,645 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:18:00,645 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:18:00,645 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:18:00,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:18:00,649 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:18:00,654 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:18:00,654 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:18:00,654 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:18:00,654 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 16:18:00,670 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 16:18:00,670 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:18:00,672 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:18:00,699 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 11 treesize of output 8 [2018-04-11 16:18:00,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 16:18:00,701 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:00,702 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:00,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:00,707 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-04-11 16:18:00,717 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:00,718 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:00,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-11 16:18:00,719 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:00,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:00,726 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:34 [2018-04-11 16:18:00,765 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 13 treesize of output 10 [2018-04-11 16:18:00,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:18:00,767 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:00,769 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:00,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:00,782 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:46 [2018-04-11 16:18:00,829 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:00,831 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 19 treesize of output 26 [2018-04-11 16:18:00,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 16:18:00,833 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:00,836 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:00,846 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 16:18:00,846 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:65 [2018-04-11 16:18:00,862 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:00,863 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:00,864 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:00,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 58 [2018-04-11 16:18:00,864 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:00,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:18:00,878 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:84 [2018-04-11 16:18:00,913 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:00,916 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 68 [2018-04-11 16:18:00,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:18:00,917 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:00,924 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:00,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:18:00,937 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:97, output treesize:102 [2018-04-11 16:18:01,001 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:01,002 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:01,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 65 [2018-04-11 16:18:01,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-11 16:18:01,007 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:01,013 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:01,027 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 16:18:01,027 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:142, output treesize:145 [2018-04-11 16:18:01,054 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:01,054 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:01,055 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:01,055 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:01,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 79 [2018-04-11 16:18:01,056 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:01,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 16:18:01,072 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:153, output treesize:145 [2018-04-11 16:18:01,124 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 13 treesize of output 22 [2018-04-11 16:18:01,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-04-11 16:18:01,125 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:01,127 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:01,147 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:01,148 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:01,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 140 [2018-04-11 16:18:01,154 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:18:01,154 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:01,167 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:01,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 16:18:01,184 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:168, output treesize:181 [2018-04-11 16:18:01,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 228 treesize of output 130 [2018-04-11 16:18:01,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 21 [2018-04-11 16:18:01,220 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:01,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 42 [2018-04-11 16:18:01,232 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:18:01,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2018-04-11 16:18:01,243 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:18:01,252 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 16:18:01,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-11 16:18:01,277 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 15 treesize of output 3 [2018-04-11 16:18:01,277 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:01,278 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:01,289 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-04-11 16:18:01,290 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:244, output treesize:58 [2018-04-11 16:18:01,355 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:01,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 63 [2018-04-11 16:18:01,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-04-11 16:18:01,357 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:01,365 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:01,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-04-11 16:18:01,377 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:66, output treesize:58 [2018-04-11 16:18:01,479 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:01,481 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:01,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 54 [2018-04-11 16:18:01,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 16:18:01,484 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:01,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 16:18:01,493 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:01,497 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:18:01,497 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 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-11 16:18:01,497 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:01,501 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 16:18:01,501 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:01,503 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:01,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:01,510 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 9 variables, input treesize:68, output treesize:3 [2018-04-11 16:18:01,542 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:18:01,543 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:18:01,543 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-11 16:18:01,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-11 16:18:01,543 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-11 16:18:01,543 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=615, Unknown=0, NotChecked=0, Total=702 [2018-04-11 16:18:01,543 INFO L87 Difference]: Start difference. First operand 324 states and 363 transitions. Second operand 27 states. [2018-04-11 16:18:03,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:18:03,619 INFO L93 Difference]: Finished difference Result 448 states and 496 transitions. [2018-04-11 16:18:03,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-11 16:18:03,619 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 64 [2018-04-11 16:18:03,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:18:03,620 INFO L225 Difference]: With dead ends: 448 [2018-04-11 16:18:03,620 INFO L226 Difference]: Without dead ends: 448 [2018-04-11 16:18:03,620 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 606 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=363, Invalid=2393, Unknown=0, NotChecked=0, Total=2756 [2018-04-11 16:18:03,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2018-04-11 16:18:03,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 341. [2018-04-11 16:18:03,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-04-11 16:18:03,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 383 transitions. [2018-04-11 16:18:03,622 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 383 transitions. Word has length 64 [2018-04-11 16:18:03,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:18:03,622 INFO L459 AbstractCegarLoop]: Abstraction has 341 states and 383 transitions. [2018-04-11 16:18:03,622 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-11 16:18:03,622 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 383 transitions. [2018-04-11 16:18:03,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-04-11 16:18:03,623 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:18:03,623 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:18:03,623 INFO L408 AbstractCegarLoop]: === Iteration 70 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 16:18:03,623 INFO L82 PathProgramCache]: Analyzing trace with hash -277236487, now seen corresponding path program 3 times [2018-04-11 16:18:03,623 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:18:03,623 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:18:03,623 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:18:03,623 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:18:03,623 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:18:03,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:18:03,628 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:18:03,632 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:18:03,632 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:18:03,632 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:18:03,633 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 16:18:03,644 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-04-11 16:18:03,644 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:18:03,646 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:18:03,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:18:03,647 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:03,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:18:03,651 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:03,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:03,653 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 16:18:03,665 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 11 treesize of output 8 [2018-04-11 16:18:03,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 16:18:03,666 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:03,667 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:03,672 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:03,672 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:27 [2018-04-11 16:18:03,681 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:03,681 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:03,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-11 16:18:03,681 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:03,688 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 16:18:03,688 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:03,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:03,694 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31 [2018-04-11 16:18:03,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 8 [2018-04-11 16:18:03,717 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:03,726 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 13 treesize of output 10 [2018-04-11 16:18:03,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:18:03,727 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:03,728 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:03,734 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:03,734 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:56, output treesize:35 [2018-04-11 16:18:03,767 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:03,769 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 19 treesize of output 26 [2018-04-11 16:18:03,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 16:18:03,770 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:03,773 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:03,788 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 16:18:03,788 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:54 [2018-04-11 16:18:03,804 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:03,804 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:03,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-11 16:18:03,805 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:03,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:18:03,814 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:65, output treesize:63 [2018-04-11 16:18:03,847 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:03,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2018-04-11 16:18:03,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:18:03,850 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:03,855 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:03,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:18:03,865 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:76, output treesize:75 [2018-04-11 16:18:03,931 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:03,942 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 106 [2018-04-11 16:18:03,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 76 [2018-04-11 16:18:03,944 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:03,960 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:03,964 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 2 case distinctions, treesize of input 54 treesize of output 71 [2018-04-11 16:18:03,964 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 16:18:03,975 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 16:18:03,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-11 16:18:03,992 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:104, output treesize:233 [2018-04-11 16:18:04,031 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:04,032 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:04,032 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:04,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 133 [2018-04-11 16:18:04,033 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:04,058 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:04,059 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:04,059 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:04,060 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:04,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 125 [2018-04-11 16:18:04,060 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:04,084 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-11 16:18:04,084 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:243, output treesize:213 [2018-04-11 16:18:04,167 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:18:04,168 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:04,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 93 [2018-04-11 16:18:04,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2018-04-11 16:18:04,172 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:04,181 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:04,209 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:04,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 123 treesize of output 118 [2018-04-11 16:18:04,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 133 [2018-04-11 16:18:04,223 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:04,286 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:04,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-11 16:18:04,322 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:239, output treesize:198 [2018-04-11 16:18:04,369 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 70 [2018-04-11 16:18:04,371 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2018-04-11 16:18:04,371 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:18:04,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2018-04-11 16:18:04,381 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:04,389 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:18:04,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 152 treesize of output 104 [2018-04-11 16:18:04,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 82 [2018-04-11 16:18:04,421 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:18:04,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 66 [2018-04-11 16:18:04,452 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:18:04,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 63 [2018-04-11 16:18:04,483 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:18:04,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 55 [2018-04-11 16:18:04,515 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:18:04,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 51 [2018-04-11 16:18:04,545 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:04,573 INFO L267 ElimStorePlain]: Start of recursive call 5: 5 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-04-11 16:18:04,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 13 dim-0 vars, and 3 xjuncts. [2018-04-11 16:18:04,608 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 7 variables, input treesize:246, output treesize:143 [2018-04-11 16:18:04,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2018-04-11 16:18:04,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 16:18:04,696 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:04,700 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:04,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-04-11 16:18:04,706 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:47, output treesize:43 [2018-04-11 16:18:04,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2018-04-11 16:18:04,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 16:18:04,806 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:04,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 16:18:04,810 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:04,813 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:18:04,813 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 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-11 16:18:04,813 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:04,814 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:04,819 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:04,819 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:53, output treesize:3 [2018-04-11 16:18:04,858 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:18:04,859 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:18:04,859 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-11 16:18:04,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-11 16:18:04,859 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-11 16:18:04,859 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=639, Unknown=1, NotChecked=0, Total=702 [2018-04-11 16:18:04,859 INFO L87 Difference]: Start difference. First operand 341 states and 383 transitions. Second operand 27 states. [2018-04-11 16:18:06,126 WARN L151 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 110 DAG size of output 110 [2018-04-11 16:18:07,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:18:07,176 INFO L93 Difference]: Finished difference Result 455 states and 507 transitions. [2018-04-11 16:18:07,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-11 16:18:07,176 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 64 [2018-04-11 16:18:07,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:18:07,177 INFO L225 Difference]: With dead ends: 455 [2018-04-11 16:18:07,177 INFO L226 Difference]: Without dead ends: 455 [2018-04-11 16:18:07,177 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=310, Invalid=2443, Unknown=3, NotChecked=0, Total=2756 [2018-04-11 16:18:07,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2018-04-11 16:18:07,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 334. [2018-04-11 16:18:07,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-04-11 16:18:07,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 376 transitions. [2018-04-11 16:18:07,179 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 376 transitions. Word has length 64 [2018-04-11 16:18:07,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:18:07,179 INFO L459 AbstractCegarLoop]: Abstraction has 334 states and 376 transitions. [2018-04-11 16:18:07,179 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-11 16:18:07,179 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 376 transitions. [2018-04-11 16:18:07,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-04-11 16:18:07,179 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:18:07,179 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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 16:18:07,179 INFO L408 AbstractCegarLoop]: === Iteration 71 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 16:18:07,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1745572431, now seen corresponding path program 3 times [2018-04-11 16:18:07,180 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:18:07,180 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:18:07,180 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:18:07,180 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:18:07,180 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:18:07,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:18:07,184 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:18:07,187 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:18:07,187 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:18:07,187 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:18:07,187 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 16:18:07,201 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-11 16:18:07,201 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:18:07,203 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:18:07,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:18:07,205 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:07,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:18:07,208 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:07,210 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:07,211 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 16:18:07,224 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 11 treesize of output 8 [2018-04-11 16:18:07,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 16:18:07,225 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:07,225 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:07,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:07,230 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-04-11 16:18:07,239 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:07,239 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 16:18:07,239 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:07,249 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:07,250 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:07,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-11 16:18:07,250 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:07,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:07,257 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:41 [2018-04-11 16:18:07,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 8 [2018-04-11 16:18:07,282 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:07,293 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 13 treesize of output 10 [2018-04-11 16:18:07,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:18:07,294 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:07,295 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:07,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:07,303 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:61, output treesize:46 [2018-04-11 16:18:07,339 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:07,341 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 19 treesize of output 26 [2018-04-11 16:18:07,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 16:18:07,342 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:07,345 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:07,353 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 16:18:07,353 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:65 [2018-04-11 16:18:07,368 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:07,369 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:07,369 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:07,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 61 [2018-04-11 16:18:07,370 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:07,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:18:07,382 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:84 [2018-04-11 16:18:07,420 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:07,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 68 [2018-04-11 16:18:07,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:18:07,423 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:07,430 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:07,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:18:07,442 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:97, output treesize:96 [2018-04-11 16:18:07,510 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:07,511 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:07,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 65 [2018-04-11 16:18:07,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-11 16:18:07,516 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:07,521 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:07,535 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 16:18:07,535 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:137, output treesize:145 [2018-04-11 16:18:07,568 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:07,569 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:07,569 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:07,570 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:07,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 86 [2018-04-11 16:18:07,570 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:07,583 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 16:18:07,584 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:150, output treesize:142 [2018-04-11 16:18:07,647 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:07,648 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:07,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 125 [2018-04-11 16:18:07,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:18:07,655 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:07,667 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:07,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 16:18:07,686 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:155, output treesize:160 [2018-04-11 16:18:07,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 186 treesize of output 104 [2018-04-11 16:18:07,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 28 [2018-04-11 16:18:07,728 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:18:07,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 24 [2018-04-11 16:18:07,747 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:18:07,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 13 [2018-04-11 16:18:07,758 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:07,766 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 16:18:07,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-04-11 16:18:07,778 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:202, output treesize:55 [2018-04-11 16:18:07,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 54 [2018-04-11 16:18:07,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 16:18:07,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:07,877 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:07,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2018-04-11 16:18:07,891 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:66, output treesize:62 [2018-04-11 16:18:08,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 50 [2018-04-11 16:18:08,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 16:18:08,002 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:08,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 16:18:08,011 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:08,015 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:18:08,015 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 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-11 16:18:08,015 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:08,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 16:18:08,019 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:08,019 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:08,027 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:08,027 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 10 variables, input treesize:72, output treesize:3 [2018-04-11 16:18:08,067 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 2 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:18:08,067 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:18:08,067 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-11 16:18:08,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-11 16:18:08,068 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-11 16:18:08,068 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=633, Unknown=0, NotChecked=0, Total=702 [2018-04-11 16:18:08,068 INFO L87 Difference]: Start difference. First operand 334 states and 376 transitions. Second operand 27 states. [2018-04-11 16:18:10,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:18:10,237 INFO L93 Difference]: Finished difference Result 452 states and 501 transitions. [2018-04-11 16:18:10,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-11 16:18:10,237 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 64 [2018-04-11 16:18:10,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:18:10,238 INFO L225 Difference]: With dead ends: 452 [2018-04-11 16:18:10,238 INFO L226 Difference]: Without dead ends: 452 [2018-04-11 16:18:10,238 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 565 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=339, Invalid=2417, Unknown=0, NotChecked=0, Total=2756 [2018-04-11 16:18:10,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2018-04-11 16:18:10,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 324. [2018-04-11 16:18:10,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2018-04-11 16:18:10,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 363 transitions. [2018-04-11 16:18:10,240 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 363 transitions. Word has length 64 [2018-04-11 16:18:10,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:18:10,240 INFO L459 AbstractCegarLoop]: Abstraction has 324 states and 363 transitions. [2018-04-11 16:18:10,241 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-11 16:18:10,241 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 363 transitions. [2018-04-11 16:18:10,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-04-11 16:18:10,241 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:18:10,241 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:18:10,241 INFO L408 AbstractCegarLoop]: === Iteration 72 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 16:18:10,241 INFO L82 PathProgramCache]: Analyzing trace with hash -105919928, now seen corresponding path program 1 times [2018-04-11 16:18:10,241 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:18:10,241 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:18:10,241 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:18:10,242 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:18:10,242 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:18:10,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:18:10,246 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:18:10,247 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:18:10,247 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:18:10,247 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:18:10,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:18:10,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:18:10,259 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:18:10,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:18:10,260 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:10,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:10,262 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 16:18:10,284 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:10,284 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:10,284 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 16:18:10,285 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:10,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:10,288 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-04-11 16:18:10,310 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 13 treesize of output 10 [2018-04-11 16:18:10,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:18:10,311 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:10,312 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:10,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:10,318 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:35 [2018-04-11 16:18:10,352 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:10,352 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:10,352 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 16:18:10,353 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:10,357 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:18:10,358 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:40 [2018-04-11 16:18:10,383 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:10,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 44 [2018-04-11 16:18:10,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:18:10,386 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:10,390 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:10,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:18:10,396 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:53, output treesize:46 [2018-04-11 16:18:10,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 72 [2018-04-11 16:18:10,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 80 [2018-04-11 16:18:10,462 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:10,477 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:10,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 65 [2018-04-11 16:18:10,481 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 16:18:10,492 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 16:18:10,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-04-11 16:18:10,505 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:80, output treesize:107 [2018-04-11 16:18:10,582 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 67 [2018-04-11 16:18:10,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2018-04-11 16:18:10,588 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 16:18:10,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 31 [2018-04-11 16:18:10,612 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 16:18:10,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 35 [2018-04-11 16:18:10,616 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-11 16:18:10,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 50 [2018-04-11 16:18:10,647 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-11 16:18:10,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2018-04-11 16:18:10,676 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:10,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2018-04-11 16:18:10,677 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:10,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2018-04-11 16:18:10,704 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:10,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2018-04-11 16:18:10,705 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:10,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 16:18:10,730 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 44 [2018-04-11 16:18:10,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 21 [2018-04-11 16:18:10,734 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-04-11 16:18:10,740 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 7 treesize of output 1 [2018-04-11 16:18:10,740 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:10,744 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 16:18:10,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-11 16:18:10,758 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 9 variables, input treesize:125, output treesize:13 [2018-04-11 16:18:10,800 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 16:18:10,801 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:18:10,801 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-11 16:18:10,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-11 16:18:10,801 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-11 16:18:10,801 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2018-04-11 16:18:10,801 INFO L87 Difference]: Start difference. First operand 324 states and 363 transitions. Second operand 21 states. [2018-04-11 16:18:11,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:18:11,842 INFO L93 Difference]: Finished difference Result 404 states and 445 transitions. [2018-04-11 16:18:11,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-11 16:18:11,842 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 65 [2018-04-11 16:18:11,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:18:11,843 INFO L225 Difference]: With dead ends: 404 [2018-04-11 16:18:11,843 INFO L226 Difference]: Without dead ends: 403 [2018-04-11 16:18:11,843 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=248, Invalid=1392, Unknown=0, NotChecked=0, Total=1640 [2018-04-11 16:18:11,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2018-04-11 16:18:11,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 330. [2018-04-11 16:18:11,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-04-11 16:18:11,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 369 transitions. [2018-04-11 16:18:11,845 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 369 transitions. Word has length 65 [2018-04-11 16:18:11,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:18:11,845 INFO L459 AbstractCegarLoop]: Abstraction has 330 states and 369 transitions. [2018-04-11 16:18:11,845 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-11 16:18:11,845 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 369 transitions. [2018-04-11 16:18:11,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-04-11 16:18:11,845 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:18:11,845 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:18:11,846 INFO L408 AbstractCegarLoop]: === Iteration 73 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 16:18:11,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1182206581, now seen corresponding path program 1 times [2018-04-11 16:18:11,846 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:18:11,846 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:18:11,846 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:18:11,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:18:11,846 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:18:11,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:18:11,851 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:18:11,852 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:18:11,852 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:18:11,852 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:18:11,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:18:11,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:18:11,863 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:18:11,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:18:11,865 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:11,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 16:18:11,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:11,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:11,870 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:11 [2018-04-11 16:18:11,901 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:11,901 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:11,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 16:18:11,902 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:11,912 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 16:18:11,912 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:11,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:11,919 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:34 [2018-04-11 16:18:11,951 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 18 treesize of output 8 [2018-04-11 16:18:11,951 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:11,959 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 13 treesize of output 10 [2018-04-11 16:18:11,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:18:11,960 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:11,961 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:11,967 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:11,967 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:55, output treesize:46 [2018-04-11 16:18:12,010 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:12,011 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:12,011 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:12,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-04-11 16:18:12,012 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:12,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:18:12,019 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:57, output treesize:50 [2018-04-11 16:18:12,050 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:12,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 54 [2018-04-11 16:18:12,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:18:12,053 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:12,060 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:12,068 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:18:12,068 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:62 [2018-04-11 16:18:12,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 75 [2018-04-11 16:18:12,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-04-11 16:18:12,148 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:12,157 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:12,168 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 16:18:12,168 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:102, output treesize:86 [2018-04-11 16:18:12,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 65 [2018-04-11 16:18:12,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 29 [2018-04-11 16:18:12,261 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 16:18:12,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-11 16:18:12,272 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:12,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-04-11 16:18:12,280 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:12,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2018-04-11 16:18:12,281 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:12,299 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 16:18:12,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-11 16:18:12,305 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:95, output treesize:13 [2018-04-11 16:18:12,356 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 16:18:12,356 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:18:12,356 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-11 16:18:12,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-11 16:18:12,356 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-11 16:18:12,356 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2018-04-11 16:18:12,356 INFO L87 Difference]: Start difference. First operand 330 states and 369 transitions. Second operand 21 states. [2018-04-11 16:18:13,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:18:13,458 INFO L93 Difference]: Finished difference Result 396 states and 437 transitions. [2018-04-11 16:18:13,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-11 16:18:13,459 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 65 [2018-04-11 16:18:13,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:18:13,460 INFO L225 Difference]: With dead ends: 396 [2018-04-11 16:18:13,460 INFO L226 Difference]: Without dead ends: 395 [2018-04-11 16:18:13,460 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=274, Invalid=1532, Unknown=0, NotChecked=0, Total=1806 [2018-04-11 16:18:13,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-04-11 16:18:13,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 330. [2018-04-11 16:18:13,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-04-11 16:18:13,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 369 transitions. [2018-04-11 16:18:13,462 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 369 transitions. Word has length 65 [2018-04-11 16:18:13,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:18:13,462 INFO L459 AbstractCegarLoop]: Abstraction has 330 states and 369 transitions. [2018-04-11 16:18:13,462 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-11 16:18:13,462 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 369 transitions. [2018-04-11 16:18:13,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-11 16:18:13,463 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:18:13,463 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:18:13,463 INFO L408 AbstractCegarLoop]: === Iteration 74 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 16:18:13,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1795902265, now seen corresponding path program 1 times [2018-04-11 16:18:13,463 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:18:13,463 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:18:13,463 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:18:13,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:18:13,463 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:18:13,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:18:13,467 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:18:13,477 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:18:13,477 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:18:13,477 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:18:13,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:18:13,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:18:13,489 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:18:13,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:18:13,511 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:13,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:18:13,515 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:13,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:13,518 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 16:18:13,538 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:13,538 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 16:18:13,539 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:13,548 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:13,549 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:13,549 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 16:18:13,549 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:13,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:13,556 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-04-11 16:18:13,574 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 13 treesize of output 10 [2018-04-11 16:18:13,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 9 [2018-04-11 16:18:13,576 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:13,577 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:13,586 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 13 treesize of output 10 [2018-04-11 16:18:13,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:18:13,587 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:13,588 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:13,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:13,594 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:45 [2018-04-11 16:18:13,635 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 78 [2018-04-11 16:18:13,636 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-04-11 16:18:13,636 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:13,641 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:13,651 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 62 treesize of output 63 [2018-04-11 16:18:13,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-04-11 16:18:13,653 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:13,657 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:13,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:13,671 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:101, output treesize:81 [2018-04-11 16:18:13,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2018-04-11 16:18:13,703 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:13,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:13,707 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:69, output treesize:50 [2018-04-11 16:18:13,805 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 56 [2018-04-11 16:18:13,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-04-11 16:18:13,807 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:18:13,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 16 [2018-04-11 16:18:13,814 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 16:18:13,819 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 16:18:13,829 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 37 treesize of output 29 [2018-04-11 16:18:13,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2018-04-11 16:18:13,833 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-11 16:18:13,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2018-04-11 16:18:13,838 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:13,838 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 16 treesize of output 6 [2018-04-11 16:18:13,838 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:13,842 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 16:18:13,843 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 46 treesize of output 36 [2018-04-11 16:18:13,844 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:13,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 10 [2018-04-11 16:18:13,845 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:13,848 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 16 treesize of output 6 [2018-04-11 16:18:13,848 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:13,849 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:13,856 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-11 16:18:13,857 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:76, output treesize:24 [2018-04-11 16:18:13,900 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:18:13,900 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:18:13,900 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-11 16:18:13,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 16:18:13,900 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 16:18:13,900 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2018-04-11 16:18:13,900 INFO L87 Difference]: Start difference. First operand 330 states and 369 transitions. Second operand 20 states. [2018-04-11 16:18:14,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:18:14,899 INFO L93 Difference]: Finished difference Result 374 states and 414 transitions. [2018-04-11 16:18:14,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 16:18:14,900 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 66 [2018-04-11 16:18:14,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:18:14,900 INFO L225 Difference]: With dead ends: 374 [2018-04-11 16:18:14,900 INFO L226 Difference]: Without dead ends: 342 [2018-04-11 16:18:14,901 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=206, Invalid=1126, Unknown=0, NotChecked=0, Total=1332 [2018-04-11 16:18:14,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-04-11 16:18:14,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 319. [2018-04-11 16:18:14,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-04-11 16:18:14,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 357 transitions. [2018-04-11 16:18:14,903 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 357 transitions. Word has length 66 [2018-04-11 16:18:14,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:18:14,903 INFO L459 AbstractCegarLoop]: Abstraction has 319 states and 357 transitions. [2018-04-11 16:18:14,903 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 16:18:14,903 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 357 transitions. [2018-04-11 16:18:14,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-11 16:18:14,903 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:18:14,903 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:18:14,903 INFO L408 AbstractCegarLoop]: === Iteration 75 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 16:18:14,903 INFO L82 PathProgramCache]: Analyzing trace with hash 2098323616, now seen corresponding path program 1 times [2018-04-11 16:18:14,903 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:18:14,903 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:18:14,904 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:18:14,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:18:14,904 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:18:14,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:18:14,908 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:18:14,914 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:18:14,914 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:18:14,914 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:18:14,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:18:14,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:18:14,927 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:18:14,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:18:14,934 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:14,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:18:14,937 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:14,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:14,940 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:11 [2018-04-11 16:18:14,960 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:14,960 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 16:18:14,960 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:14,968 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:14,969 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:14,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-11 16:18:14,969 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:14,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:14,974 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-04-11 16:18:14,989 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 13 treesize of output 10 [2018-04-11 16:18:14,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:18:14,990 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:14,991 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:14,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:14,997 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:40 [2018-04-11 16:18:15,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2018-04-11 16:18:15,050 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:15,061 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 55 [2018-04-11 16:18:15,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 16:18:15,062 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:15,067 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:15,075 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 25 treesize of output 16 [2018-04-11 16:18:15,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 16:18:15,076 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:15,078 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:15,084 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 16:18:15,084 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:103, output treesize:53 [2018-04-11 16:18:15,257 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:15,258 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:18:15,259 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 69 [2018-04-11 16:18:15,261 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:18:15,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 28 [2018-04-11 16:18:15,261 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:18:15,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-11 16:18:15,271 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 16:18:15,277 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 16:18:15,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-04-11 16:18:15,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-11 16:18:15,296 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-11 16:18:15,300 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 16:18:15,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-11 16:18:15,303 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:15,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-04-11 16:18:15,303 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:15,306 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:15,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-11 16:18:15,320 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:79, output treesize:29 [2018-04-11 16:18:15,378 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 16:18:15,378 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:18:15,378 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-11 16:18:15,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 16:18:15,379 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 16:18:15,379 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2018-04-11 16:18:15,379 INFO L87 Difference]: Start difference. First operand 319 states and 357 transitions. Second operand 20 states. [2018-04-11 16:18:16,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:18:16,474 INFO L93 Difference]: Finished difference Result 342 states and 381 transitions. [2018-04-11 16:18:16,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-11 16:18:16,475 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 66 [2018-04-11 16:18:16,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:18:16,475 INFO L225 Difference]: With dead ends: 342 [2018-04-11 16:18:16,476 INFO L226 Difference]: Without dead ends: 310 [2018-04-11 16:18:16,476 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=243, Invalid=1397, Unknown=0, NotChecked=0, Total=1640 [2018-04-11 16:18:16,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-04-11 16:18:16,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 293. [2018-04-11 16:18:16,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-04-11 16:18:16,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 330 transitions. [2018-04-11 16:18:16,477 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 330 transitions. Word has length 66 [2018-04-11 16:18:16,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:18:16,478 INFO L459 AbstractCegarLoop]: Abstraction has 293 states and 330 transitions. [2018-04-11 16:18:16,478 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 16:18:16,478 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 330 transitions. [2018-04-11 16:18:16,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-11 16:18:16,478 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:18:16,478 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:18:16,478 INFO L408 AbstractCegarLoop]: === Iteration 76 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 16:18:16,478 INFO L82 PathProgramCache]: Analyzing trace with hash -767487113, now seen corresponding path program 6 times [2018-04-11 16:18:16,478 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:18:16,478 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:18:16,479 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:18:16,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:18:16,479 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:18:16,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:18:16,489 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:18:16,491 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:18:16,492 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:18:16,492 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:18:16,492 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 16:18:16,508 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2018-04-11 16:18:16,508 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:18:16,510 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:18:16,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:18:16,512 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:16,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:18:16,529 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:16,531 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:16,531 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:11 [2018-04-11 16:18:16,554 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:16,554 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 16:18:16,554 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:16,563 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:16,564 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:16,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-11 16:18:16,564 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:16,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:16,571 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:31 [2018-04-11 16:18:16,595 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 13 treesize of output 10 [2018-04-11 16:18:16,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:18:16,596 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:16,597 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:16,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:16,607 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:56 [2018-04-11 16:18:16,669 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:16,670 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:16,671 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:16,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 58 [2018-04-11 16:18:16,671 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:16,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 53 [2018-04-11 16:18:16,688 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:16,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:18:16,703 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:82, output treesize:89 [2018-04-11 16:18:16,745 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:16,747 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:16,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 77 [2018-04-11 16:18:16,749 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-04-11 16:18:16,749 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:16,756 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:16,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:18:16,771 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:114, output treesize:104 [2018-04-11 16:18:16,864 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:16,865 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:16,893 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:16,894 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:16,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 137 [2018-04-11 16:18:16,895 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:16,918 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:16,919 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:16,919 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:16,920 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:16,920 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:16,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 79 [2018-04-11 16:18:16,921 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:16,938 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 16:18:16,939 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:160, output treesize:151 [2018-04-11 16:18:17,005 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:17,006 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:17,006 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:17,009 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:17,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 142 [2018-04-11 16:18:17,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:18:17,013 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:17,028 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:17,052 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 13 treesize of output 22 [2018-04-11 16:18:17,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-04-11 16:18:17,053 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:17,055 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:17,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 16:18:17,077 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:179, output treesize:186 [2018-04-11 16:18:17,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 15 [2018-04-11 16:18:17,109 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 15 treesize of output 3 [2018-04-11 16:18:17,110 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:17,111 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:17,129 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 16:18:17,129 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:285, output treesize:246 [2018-04-11 16:18:17,214 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:17,228 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:17,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 251 treesize of output 179 [2018-04-11 16:18:17,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-04-11 16:18:17,232 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:17,246 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:17,263 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 16:18:17,263 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:269, output treesize:247 [2018-04-11 16:18:17,519 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:17,519 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:17,520 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:17,520 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:18:17,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 198 [2018-04-11 16:18:17,521 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:17,546 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:17,547 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:17,547 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:17,547 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:18:17,548 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:17,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 138 [2018-04-11 16:18:17,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 29 [2018-04-11 16:18:17,554 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:17,562 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:18:17,562 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 25 [2018-04-11 16:18:17,562 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:17,567 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:18:17,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-04-11 16:18:17,568 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:17,570 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:17,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:17,578 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:288, output treesize:5 [2018-04-11 16:18:17,645 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:18:17,645 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:18:17,645 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-04-11 16:18:17,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-11 16:18:17,646 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-11 16:18:17,646 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=772, Unknown=0, NotChecked=0, Total=870 [2018-04-11 16:18:17,646 INFO L87 Difference]: Start difference. First operand 293 states and 330 transitions. Second operand 30 states. [2018-04-11 16:18:19,174 WARN L151 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 125 DAG size of output 123 [2018-04-11 16:18:21,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:18:21,110 INFO L93 Difference]: Finished difference Result 417 states and 463 transitions. [2018-04-11 16:18:21,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-11 16:18:21,110 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 66 [2018-04-11 16:18:21,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:18:21,111 INFO L225 Difference]: With dead ends: 417 [2018-04-11 16:18:21,111 INFO L226 Difference]: Without dead ends: 417 [2018-04-11 16:18:21,111 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 937 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=470, Invalid=3312, Unknown=0, NotChecked=0, Total=3782 [2018-04-11 16:18:21,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2018-04-11 16:18:21,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 319. [2018-04-11 16:18:21,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-04-11 16:18:21,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 361 transitions. [2018-04-11 16:18:21,113 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 361 transitions. Word has length 66 [2018-04-11 16:18:21,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:18:21,114 INFO L459 AbstractCegarLoop]: Abstraction has 319 states and 361 transitions. [2018-04-11 16:18:21,114 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-11 16:18:21,114 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 361 transitions. [2018-04-11 16:18:21,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-11 16:18:21,114 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:18:21,114 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:18:21,114 INFO L408 AbstractCegarLoop]: === Iteration 77 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 16:18:21,114 INFO L82 PathProgramCache]: Analyzing trace with hash -767487112, now seen corresponding path program 5 times [2018-04-11 16:18:21,114 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:18:21,114 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:18:21,115 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:18:21,115 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:18:21,115 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:18:21,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:18:21,120 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:18:21,124 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:18:21,124 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:18:21,124 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:18:21,124 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 16:18:21,139 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-04-11 16:18:21,139 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:18:21,142 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:18:21,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:18:21,148 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:21,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:21,151 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 16:18:21,170 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:21,171 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:21,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-11 16:18:21,171 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:21,182 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 16:18:21,182 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:21,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:21,199 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:37 [2018-04-11 16:18:21,228 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 13 treesize of output 10 [2018-04-11 16:18:21,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:18:21,230 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:21,231 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:21,265 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 13 treesize of output 10 [2018-04-11 16:18:21,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 9 [2018-04-11 16:18:21,266 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:21,268 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:21,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:21,279 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:67, output treesize:68 [2018-04-11 16:18:21,328 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 11 treesize of output 14 [2018-04-11 16:18:21,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 16:18:21,330 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:21,332 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:21,346 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 16:18:21,346 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:93, output treesize:90 [2018-04-11 16:18:21,366 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:21,366 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:21,367 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:21,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 58 [2018-04-11 16:18:21,367 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:21,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 53 [2018-04-11 16:18:21,392 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:21,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:18:21,423 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:110, output treesize:117 [2018-04-11 16:18:21,477 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 0 case distinctions, treesize of input 36 treesize of output 28 [2018-04-11 16:18:21,477 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:21,504 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:21,507 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:21,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 58 [2018-04-11 16:18:21,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-04-11 16:18:21,509 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:21,516 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:21,536 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:21,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 30 [2018-04-11 16:18:21,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 16:18:21,566 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:21,572 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:21,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:18:21,604 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:152, output treesize:103 [2018-04-11 16:18:21,682 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:21,684 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 44 [2018-04-11 16:18:21,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-11 16:18:21,686 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:21,689 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:21,706 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 16:18:21,706 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:155, output treesize:146 [2018-04-11 16:18:21,732 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:21,732 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:21,732 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:21,733 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:21,733 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:21,734 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:21,734 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:21,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 43 [2018-04-11 16:18:21,735 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:21,751 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 16:18:21,751 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:151, output treesize:143 [2018-04-11 16:18:21,805 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:21,806 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:21,806 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:21,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 71 [2018-04-11 16:18:21,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-04-11 16:18:21,813 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:21,819 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:21,840 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:21,840 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:21,841 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:21,843 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:21,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 153 [2018-04-11 16:18:21,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:18:21,847 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:21,859 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:21,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 16:18:21,877 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:169, output treesize:161 [2018-04-11 16:18:21,974 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:21,975 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:21,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 107 [2018-04-11 16:18:21,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-04-11 16:18:21,980 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:21,986 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:22,006 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 16:18:22,006 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:226, output treesize:240 [2018-04-11 16:18:22,047 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:22,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 113 [2018-04-11 16:18:22,054 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-04-11 16:18:22,054 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:22,060 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:22,083 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:22,087 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:22,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 271 treesize of output 193 [2018-04-11 16:18:22,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-04-11 16:18:22,092 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:22,107 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:22,128 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-11 16:18:22,128 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:317, output treesize:273 [2018-04-11 16:18:22,217 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:22,220 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:22,221 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 256 treesize of output 157 [2018-04-11 16:18:22,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 37 [2018-04-11 16:18:22,223 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:18:22,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 24 [2018-04-11 16:18:22,240 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:18:22,254 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:18:22,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 34 [2018-04-11 16:18:22,254 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:22,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-11 16:18:22,267 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:22,277 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 16:18:22,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 39 [2018-04-11 16:18:22,305 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 7 treesize of output 1 [2018-04-11 16:18:22,305 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:22,313 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:18:22,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-04-11 16:18:22,313 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:22,318 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 7 treesize of output 1 [2018-04-11 16:18:22,318 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:22,319 INFO L267 ElimStorePlain]: Start of recursive call 7: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:22,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-04-11 16:18:22,335 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 7 variables, input treesize:284, output treesize:43 [2018-04-11 16:18:22,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2018-04-11 16:18:22,420 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:18:22,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-11 16:18:22,420 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:22,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 16:18:22,427 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:22,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 16:18:22,430 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:22,431 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:22,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:22,436 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:47, output treesize:3 [2018-04-11 16:18:22,485 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:18:22,486 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:18:22,486 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-04-11 16:18:22,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-11 16:18:22,486 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-11 16:18:22,486 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=733, Unknown=0, NotChecked=0, Total=812 [2018-04-11 16:18:22,486 INFO L87 Difference]: Start difference. First operand 319 states and 361 transitions. Second operand 29 states. [2018-04-11 16:18:25,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:18:25,136 INFO L93 Difference]: Finished difference Result 417 states and 461 transitions. [2018-04-11 16:18:25,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-11 16:18:25,136 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 66 [2018-04-11 16:18:25,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:18:25,136 INFO L225 Difference]: With dead ends: 417 [2018-04-11 16:18:25,137 INFO L226 Difference]: Without dead ends: 417 [2018-04-11 16:18:25,137 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 680 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=368, Invalid=2824, Unknown=0, NotChecked=0, Total=3192 [2018-04-11 16:18:25,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2018-04-11 16:18:25,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 315. [2018-04-11 16:18:25,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-04-11 16:18:25,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 355 transitions. [2018-04-11 16:18:25,139 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 355 transitions. Word has length 66 [2018-04-11 16:18:25,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:18:25,139 INFO L459 AbstractCegarLoop]: Abstraction has 315 states and 355 transitions. [2018-04-11 16:18:25,139 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-11 16:18:25,139 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 355 transitions. [2018-04-11 16:18:25,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-11 16:18:25,139 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:18:25,139 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:18:25,139 INFO L408 AbstractCegarLoop]: === Iteration 78 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-11 16:18:25,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1920487905, now seen corresponding path program 7 times [2018-04-11 16:18:25,139 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:18:25,139 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:18:25,140 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:18:25,140 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:18:25,140 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:18:25,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:18:25,145 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:18:25,152 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 16:18:25,152 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:18:25,152 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:18:25,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:18:25,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:18:25,170 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:18:25,172 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:18:25,172 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:25,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:25,174 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 16:18:25,190 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:25,191 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:25,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-11 16:18:25,191 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:25,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:25,197 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-04-11 16:18:25,220 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 13 treesize of output 10 [2018-04-11 16:18:25,221 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 9 [2018-04-11 16:18:25,221 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:25,222 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:25,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 16:18:25,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:18:25,233 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:25,234 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:25,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:25,240 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:45 [2018-04-11 16:18:25,297 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:25,298 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:25,298 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:25,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 58 [2018-04-11 16:18:25,299 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:25,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:25,310 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:71, output treesize:79 [2018-04-11 16:18:25,350 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:25,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-04-11 16:18:25,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 16:18:25,354 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:25,358 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:25,374 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:25,376 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:25,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 81 [2018-04-11 16:18:25,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-04-11 16:18:25,377 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:25,384 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:25,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:25,396 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:110, output treesize:87 [2018-04-11 16:18:25,487 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:25,487 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:25,488 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:25,488 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:25,489 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:25,489 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 79 [2018-04-11 16:18:25,490 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:25,501 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:18:25,501 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:119, output treesize:111 [2018-04-11 16:18:25,539 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:25,540 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:25,540 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:25,543 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:25,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 107 [2018-04-11 16:18:25,546 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 16:18:25,546 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:25,556 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:25,572 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:25,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 45 [2018-04-11 16:18:25,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-04-11 16:18:25,576 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:25,580 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:25,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 16:18:25,594 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:142, output treesize:140 [2018-04-11 16:18:25,676 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 11 treesize of output 26 [2018-04-11 16:18:25,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-04-11 16:18:25,678 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:25,679 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:25,700 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 16:18:25,700 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:241, output treesize:255 [2018-04-11 16:18:25,734 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:25,736 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:25,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 305 treesize of output 203 [2018-04-11 16:18:25,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-04-11 16:18:25,747 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:25,766 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:25,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 161 [2018-04-11 16:18:25,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-04-11 16:18:25,799 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:25,808 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:25,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 16:18:25,831 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:332, output treesize:288 [2018-04-11 16:18:25,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2018-04-11 16:18:25,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 16:18:25,908 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:25,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 16:18:25,912 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:25,913 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:25,934 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 16:18:25,934 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:266, output treesize:236 [2018-04-11 16:18:25,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 103 [2018-04-11 16:18:25,982 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:18:25,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-04-11 16:18:25,982 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:25,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-04-11 16:18:25,992 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:25,997 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 7 treesize of output 1 [2018-04-11 16:18:25,997 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:26,000 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:26,016 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-04-11 16:18:26,016 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:254, output treesize:177 [2018-04-11 16:18:26,139 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:26,139 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:26,139 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:18:26,140 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 16:18:26,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 120 [2018-04-11 16:18:26,146 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 7 treesize of output 1 [2018-04-11 16:18:26,146 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:26,156 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:18:26,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 31 [2018-04-11 16:18:26,156 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:26,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, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2018-04-11 16:18:26,163 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:26,167 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 16:18:26,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2018-04-11 16:18:26,168 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 16:18:26,170 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:26,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 16:18:26,177 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:186, output treesize:5 [2018-04-11 16:18:26,239 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:18:26,239 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:18:26,239 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-04-11 16:18:26,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-11 16:18:26,240 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-11 16:18:26,240 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=778, Unknown=0, NotChecked=0, Total=870 [2018-04-11 16:18:26,240 INFO L87 Difference]: Start difference. First operand 315 states and 355 transitions. Second operand 30 states. Received shutdown request... [2018-04-11 16:18:28,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-11 16:18:28,511 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-11 16:18:28,515 WARN L197 ceAbstractionStarter]: Timeout [2018-04-11 16:18:28,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 04:18:28 BoogieIcfgContainer [2018-04-11 16:18:28,515 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 16:18:28,516 INFO L168 Benchmark]: Toolchain (without parser) took 177726.62 ms. Allocated memory was 402.1 MB in the beginning and 701.5 MB in the end (delta: 299.4 MB). Free memory was 334.1 MB in the beginning and 567.7 MB in the end (delta: -233.6 MB). Peak memory consumption was 65.7 MB. Max. memory is 5.3 GB. [2018-04-11 16:18:28,517 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 402.1 MB. Free memory is still 359.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 16:18:28,517 INFO L168 Benchmark]: CACSL2BoogieTranslator took 262.36 ms. Allocated memory is still 402.1 MB. Free memory was 332.8 MB in the beginning and 309.0 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 5.3 GB. [2018-04-11 16:18:28,517 INFO L168 Benchmark]: Boogie Preprocessor took 47.10 ms. Allocated memory is still 402.1 MB. Free memory was 309.0 MB in the beginning and 306.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-11 16:18:28,517 INFO L168 Benchmark]: RCFGBuilder took 453.08 ms. Allocated memory was 402.1 MB in the beginning and 613.4 MB in the end (delta: 211.3 MB). Free memory was 306.3 MB in the beginning and 539.8 MB in the end (delta: -233.5 MB). Peak memory consumption was 25.1 MB. Max. memory is 5.3 GB. [2018-04-11 16:18:28,517 INFO L168 Benchmark]: TraceAbstraction took 176961.07 ms. Allocated memory was 613.4 MB in the beginning and 701.5 MB in the end (delta: 88.1 MB). Free memory was 539.8 MB in the beginning and 567.7 MB in the end (delta: -27.9 MB). Peak memory consumption was 60.2 MB. Max. memory is 5.3 GB. [2018-04-11 16:18:28,519 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.14 ms. Allocated memory is still 402.1 MB. Free memory is still 359.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 262.36 ms. Allocated memory is still 402.1 MB. Free memory was 332.8 MB in the beginning and 309.0 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 47.10 ms. Allocated memory is still 402.1 MB. Free memory was 309.0 MB in the beginning and 306.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 453.08 ms. Allocated memory was 402.1 MB in the beginning and 613.4 MB in the end (delta: 211.3 MB). Free memory was 306.3 MB in the beginning and 539.8 MB in the end (delta: -233.5 MB). Peak memory consumption was 25.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 176961.07 ms. Allocated memory was 613.4 MB in the beginning and 701.5 MB in the end (delta: 88.1 MB). Free memory was 539.8 MB in the beginning and 567.7 MB in the end (delta: -27.9 MB). Peak memory consumption was 60.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 639]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was constructing difference of abstraction (315states) and interpolant automaton (currently 33 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 649]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was constructing difference of abstraction (315states) and interpolant automaton (currently 33 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 626]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 626). Cancelled while BasicCegarLoop was constructing difference of abstraction (315states) and interpolant automaton (currently 33 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 666]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was constructing difference of abstraction (315states) and interpolant automaton (currently 33 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 665]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 665). Cancelled while BasicCegarLoop was constructing difference of abstraction (315states) and interpolant automaton (currently 33 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 656]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 656). Cancelled while BasicCegarLoop was constructing difference of abstraction (315states) and interpolant automaton (currently 33 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 660]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was constructing difference of abstraction (315states) and interpolant automaton (currently 33 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 635]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 635). Cancelled while BasicCegarLoop was constructing difference of abstraction (315states) and interpolant automaton (currently 33 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 658]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was constructing difference of abstraction (315states) and interpolant automaton (currently 33 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 666]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was constructing difference of abstraction (315states) and interpolant automaton (currently 33 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (315states) and interpolant automaton (currently 33 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 650]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was constructing difference of abstraction (315states) and interpolant automaton (currently 33 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 654]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 654). Cancelled while BasicCegarLoop was constructing difference of abstraction (315states) and interpolant automaton (currently 33 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 662]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 662). Cancelled while BasicCegarLoop was constructing difference of abstraction (315states) and interpolant automaton (currently 33 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (315states) and interpolant automaton (currently 33 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 649]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was constructing difference of abstraction (315states) and interpolant automaton (currently 33 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (315states) and interpolant automaton (currently 33 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 656]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 656). Cancelled while BasicCegarLoop was constructing difference of abstraction (315states) and interpolant automaton (currently 33 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 660]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was constructing difference of abstraction (315states) and interpolant automaton (currently 33 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 665]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 665). Cancelled while BasicCegarLoop was constructing difference of abstraction (315states) and interpolant automaton (currently 33 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 635]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 635). Cancelled while BasicCegarLoop was constructing difference of abstraction (315states) and interpolant automaton (currently 33 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 667]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 667). Cancelled while BasicCegarLoop was constructing difference of abstraction (315states) and interpolant automaton (currently 33 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 654]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 654). Cancelled while BasicCegarLoop was constructing difference of abstraction (315states) and interpolant automaton (currently 33 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 646]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was constructing difference of abstraction (315states) and interpolant automaton (currently 33 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (315states) and interpolant automaton (currently 33 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 658]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was constructing difference of abstraction (315states) and interpolant automaton (currently 33 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 667]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 667). Cancelled while BasicCegarLoop was constructing difference of abstraction (315states) and interpolant automaton (currently 33 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 647]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (315states) and interpolant automaton (currently 33 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 662]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 662). Cancelled while BasicCegarLoop was constructing difference of abstraction (315states) and interpolant automaton (currently 33 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 646]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was constructing difference of abstraction (315states) and interpolant automaton (currently 33 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 647]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (315states) and interpolant automaton (currently 33 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 670]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 670). Cancelled while BasicCegarLoop was constructing difference of abstraction (315states) and interpolant automaton (currently 33 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 639]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was constructing difference of abstraction (315states) and interpolant automaton (currently 33 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 650]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was constructing difference of abstraction (315states) and interpolant automaton (currently 33 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 670]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 670). Cancelled while BasicCegarLoop was constructing difference of abstraction (315states) and interpolant automaton (currently 33 states, 30 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 108 locations, 35 error locations. TIMEOUT Result, 176.9s OverallTime, 78 OverallIterations, 4 TraceHistogramMax, 128.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6848 SDtfs, 29552 SDslu, 69983 SDs, 0 SdLazy, 89444 SolverSat, 4066 SolverUnsat, 49 SolverUnknown, 0 SolverNotchecked, 64.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5291 GetRequests, 2381 SyntacticMatches, 41 SemanticMatches, 2869 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 24609 ImplicationChecksByTransitivity, 80.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=341occurred in iteration=69, 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.2s AutomataMinimizationTime, 77 MinimizatonAttempts, 6318 StatesRemovedByMinimization, 76 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 46.1s InterpolantComputationTime, 7893 NumberOfCodeBlocks, 7865 NumberOfCodeBlocksAsserted, 200 NumberOfCheckSat, 3996 ConstructedInterpolants, 1888 QuantifiedInterpolants, 12615145 SizeOfPredicates, 1383 NumberOfNonLiveVariables, 14608 ConjunctsInSsa, 3604 ConjunctsInUnsatCore, 78 InterpolantComputations, 11 PerfectInterpolantSequences, 142/1376 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/list-ext_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_16-18-28-525.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/list-ext_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_16-18-28-525.csv Completed graceful shutdown