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/memsafety/test-0504_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-408c70d-m [2018-04-13 05:46:40,315 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-13 05:46:40,316 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-13 05:46:40,327 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-13 05:46:40,327 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-13 05:46:40,328 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-13 05:46:40,329 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-13 05:46:40,331 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-13 05:46:40,332 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-13 05:46:40,333 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-13 05:46:40,334 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-13 05:46:40,334 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-13 05:46:40,335 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-13 05:46:40,336 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-13 05:46:40,337 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-13 05:46:40,338 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-13 05:46:40,340 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-13 05:46:40,341 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-13 05:46:40,342 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-13 05:46:40,343 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-13 05:46:40,344 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-13 05:46:40,345 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-13 05:46:40,345 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-13 05:46:40,346 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-13 05:46:40,347 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-13 05:46:40,347 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-13 05:46:40,348 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-13 05:46:40,348 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-13 05:46:40,349 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-13 05:46:40,349 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-13 05:46:40,350 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-13 05:46:40,350 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-13 05:46:40,360 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-13 05:46:40,361 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-13 05:46:40,362 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-13 05:46:40,362 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-13 05:46:40,362 INFO L133 SettingsManager]: * Use SBE=true [2018-04-13 05:46:40,362 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-13 05:46:40,362 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-13 05:46:40,362 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-13 05:46:40,363 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-13 05:46:40,363 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-13 05:46:40,363 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-13 05:46:40,363 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-13 05:46:40,363 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-13 05:46:40,364 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-13 05:46:40,364 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-13 05:46:40,364 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-13 05:46:40,364 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-13 05:46:40,364 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-13 05:46:40,364 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-13 05:46:40,365 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-13 05:46:40,365 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-13 05:46:40,365 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-13 05:46:40,365 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-13 05:46:40,365 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-13 05:46:40,397 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-13 05:46:40,406 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-13 05:46:40,409 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-13 05:46:40,410 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-13 05:46:40,411 INFO L276 PluginConnector]: CDTParser initialized [2018-04-13 05:46:40,411 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,690 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG212aeb668 [2018-04-13 05:46:40,831 INFO L287 CDTParser]: IsIndexed: true [2018-04-13 05:46:40,831 INFO L288 CDTParser]: Found 1 translation units. [2018-04-13 05:46:40,832 INFO L168 CDTParser]: Scanning test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,838 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-13 05:46:40,839 INFO L215 ultiparseSymbolTable]: [2018-04-13 05:46:40,839 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-13 05:46:40,839 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,839 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-13 05:46:40,839 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____rlim64_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,839 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__uid_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,839 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____suseconds_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,839 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__time_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,839 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_rwlock_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,840 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____dev_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,840 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____fsblkcnt_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,840 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__mode_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,840 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__int16_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,840 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__lldiv_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,840 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____u_short in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,840 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____rlim_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,840 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__fd_set in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,840 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____caddr_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,840 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_mutex_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,841 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__size_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,841 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_key_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,841 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__sigset_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,841 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__blkcnt_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,841 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__caddr_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,841 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__blksize_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,841 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____mode_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,841 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____u_long in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,841 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____intptr_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,841 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__div_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,842 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____int16_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,842 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____uint32_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,842 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____blkcnt64_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,842 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__off_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,842 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_rwlockattr_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,842 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____nlink_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,842 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__u_char in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,842 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____quad_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,842 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__timer_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,842 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____pthread_list_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,842 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____ssize_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,843 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____socklen_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,843 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_barrier_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,843 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____u_quad_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,843 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__int32_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,843 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____uint64_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,843 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__fsfilcnt_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,843 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____off_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,843 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_mutexattr_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,843 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____pid_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,843 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____fsblkcnt64_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,844 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____u_char in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,844 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____off64_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,844 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__key_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,844 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____sig_atomic_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,844 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__u_int32_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,844 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____fd_mask in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,844 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____id_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,844 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__u_int in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,844 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____int32_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,844 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,844 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____gid_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,844 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____timer_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,845 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__fsblkcnt_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,845 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____u_int in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,845 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__dev_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,845 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__u_int8_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,845 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____key_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,845 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____uint8_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,845 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__loff_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,845 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__uint in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,845 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____clockid_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,845 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__clockid_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,845 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__nlink_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,845 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____int64_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,846 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_attr_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,846 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__wchar_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,846 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____useconds_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,846 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__fd_mask in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,846 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_once_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,846 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____uid_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,846 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__ssize_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,846 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____ino_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,846 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____sigset_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,846 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____ino64_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,847 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__quad_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,847 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__u_int16_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,847 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_spinlock_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,847 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_cond_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,847 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____blkcnt_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,847 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__id_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,847 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__gid_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,847 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__ldiv_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,847 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__u_int64_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,847 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__daddr_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,847 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____int8_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,847 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__u_short in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,847 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_barrierattr_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,847 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____fsid_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,847 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__register_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,847 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__ulong in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,847 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____fsfilcnt64_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,847 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__u_long in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,847 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__ino_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,848 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__clock_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,848 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____swblk_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,848 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pid_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,848 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____WAIT_STATUS in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,848 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__u_quad_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,848 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__ushort in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,848 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____fsfilcnt_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,848 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__suseconds_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,848 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____loff_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,848 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____time_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,848 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__int8_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,848 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____qaddr_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,848 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____uint16_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,848 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____blksize_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,848 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__fsid_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,848 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____clock_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,848 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____daddr_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,848 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__int64_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,849 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_condattr_t in test-0504_true-valid-memsafety.i [2018-04-13 05:46:40,862 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG212aeb668 [2018-04-13 05:46:40,865 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-13 05:46:40,865 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-13 05:46:40,866 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-13 05:46:40,866 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-13 05:46:40,870 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-13 05:46:40,870 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 05:46:40" (1/1) ... [2018-04-13 05:46:40,872 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3aaee925 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:46:40, skipping insertion in model container [2018-04-13 05:46:40,872 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 05:46:40" (1/1) ... [2018-04-13 05:46:40,882 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-13 05:46:40,904 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-13 05:46:41,030 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-13 05:46:41,066 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-13 05:46:41,071 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 113 non ball SCCs. Number of states in SCCs 113. [2018-04-13 05:46:41,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:46:41 WrapperNode [2018-04-13 05:46:41,102 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-13 05:46:41,102 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-13 05:46:41,102 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-13 05:46:41,103 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-13 05:46:41,111 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:46:41" (1/1) ... [2018-04-13 05:46:41,111 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:46:41" (1/1) ... [2018-04-13 05:46:41,121 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:46:41" (1/1) ... [2018-04-13 05:46:41,121 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:46:41" (1/1) ... [2018-04-13 05:46:41,130 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:46:41" (1/1) ... [2018-04-13 05:46:41,135 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:46:41" (1/1) ... [2018-04-13 05:46:41,137 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:46:41" (1/1) ... [2018-04-13 05:46:41,140 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-13 05:46:41,141 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-13 05:46:41,141 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-13 05:46:41,141 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-13 05:46:41,142 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:46:41" (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-13 05:46:41,234 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-13 05:46:41,234 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-13 05:46:41,234 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-13 05:46:41,234 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-13 05:46:41,234 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-13 05:46:41,234 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-13 05:46:41,234 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-13 05:46:41,235 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-13 05:46:41,235 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-13 05:46:41,235 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-13 05:46:41,235 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-13 05:46:41,235 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-13 05:46:41,235 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-13 05:46:41,235 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-13 05:46:41,235 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-13 05:46:41,235 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-13 05:46:41,236 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-13 05:46:41,236 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-13 05:46:41,236 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-13 05:46:41,236 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-13 05:46:41,236 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-13 05:46:41,236 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-13 05:46:41,236 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-13 05:46:41,236 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-13 05:46:41,236 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-13 05:46:41,236 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-13 05:46:41,237 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-13 05:46:41,237 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-13 05:46:41,237 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-13 05:46:41,237 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-13 05:46:41,237 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-13 05:46:41,237 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-13 05:46:41,237 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-13 05:46:41,237 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-13 05:46:41,237 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-13 05:46:41,237 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-13 05:46:41,237 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-13 05:46:41,238 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-13 05:46:41,238 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-13 05:46:41,238 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-13 05:46:41,238 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-13 05:46:41,238 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-13 05:46:41,238 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-13 05:46:41,238 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-13 05:46:41,238 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-13 05:46:41,238 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-13 05:46:41,239 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-13 05:46:41,239 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-13 05:46:41,239 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-13 05:46:41,239 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-13 05:46:41,239 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-13 05:46:41,239 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-13 05:46:41,239 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-13 05:46:41,239 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-13 05:46:41,239 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-13 05:46:41,240 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-13 05:46:41,240 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-13 05:46:41,240 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-13 05:46:41,240 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-13 05:46:41,240 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-13 05:46:41,240 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-13 05:46:41,240 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-13 05:46:41,240 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-13 05:46:41,240 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-13 05:46:41,240 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-13 05:46:41,241 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-13 05:46:41,241 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-13 05:46:41,241 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-13 05:46:41,241 INFO L128 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-04-13 05:46:41,241 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-13 05:46:41,241 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-13 05:46:41,241 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-13 05:46:41,241 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-13 05:46:41,241 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-13 05:46:41,241 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-13 05:46:41,242 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-13 05:46:41,242 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-13 05:46:41,242 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-13 05:46:41,242 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-13 05:46:41,242 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-13 05:46:41,242 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-13 05:46:41,242 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-13 05:46:41,242 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-13 05:46:41,242 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-13 05:46:41,242 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-13 05:46:41,242 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-13 05:46:41,242 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-13 05:46:41,242 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-13 05:46:41,242 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-13 05:46:41,243 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-13 05:46:41,243 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-13 05:46:41,243 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-13 05:46:41,243 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-13 05:46:41,243 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-13 05:46:41,243 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-13 05:46:41,243 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-13 05:46:41,243 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-13 05:46:41,243 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-13 05:46:41,243 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-13 05:46:41,243 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-13 05:46:41,243 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-13 05:46:41,243 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-13 05:46:41,243 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-13 05:46:41,244 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-13 05:46:41,244 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-13 05:46:41,244 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-13 05:46:41,244 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-13 05:46:41,244 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-13 05:46:41,244 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-13 05:46:41,244 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-13 05:46:41,244 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-13 05:46:41,244 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-13 05:46:41,244 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-13 05:46:41,245 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-13 05:46:41,245 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-13 05:46:41,245 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-13 05:46:41,559 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-13 05:46:41,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 05:46:41 BoogieIcfgContainer [2018-04-13 05:46:41,559 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-13 05:46:41,560 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-13 05:46:41,560 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-13 05:46:41,563 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-13 05:46:41,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 05:46:40" (1/3) ... [2018-04-13 05:46:41,564 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7262f93c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 05:46:41, skipping insertion in model container [2018-04-13 05:46:41,564 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:46:41" (2/3) ... [2018-04-13 05:46:41,565 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7262f93c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 05:46:41, skipping insertion in model container [2018-04-13 05:46:41,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 05:46:41" (3/3) ... [2018-04-13 05:46:41,566 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0504_true-valid-memsafety.i [2018-04-13 05:46:41,575 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-13 05:46:41,584 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 39 error locations. [2018-04-13 05:46:41,618 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-13 05:46:41,619 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-13 05:46:41,619 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-13 05:46:41,619 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-13 05:46:41,619 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-13 05:46:41,619 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-13 05:46:41,619 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-13 05:46:41,619 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-13 05:46:41,619 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-13 05:46:41,620 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-13 05:46:41,632 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2018-04-13 05:46:41,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-04-13 05:46:41,641 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:46:41,641 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:46:41,642 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-13 05:46:41,646 INFO L82 PathProgramCache]: Analyzing trace with hash -671861095, now seen corresponding path program 1 times [2018-04-13 05:46:41,647 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:46:41,648 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:46:41,690 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:46:41,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:46:41,690 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:46:41,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:46:41,725 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:46:41,751 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-13 05:46:41,753 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 05:46:41,753 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-13 05:46:41,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-04-13 05:46:41,766 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-04-13 05:46:41,767 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-04-13 05:46:41,768 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 2 states. [2018-04-13 05:46:41,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:46:41,784 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2018-04-13 05:46:41,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-04-13 05:46:41,785 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-04-13 05:46:41,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:46:41,794 INFO L225 Difference]: With dead ends: 98 [2018-04-13 05:46:41,795 INFO L226 Difference]: Without dead ends: 95 [2018-04-13 05:46:41,796 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-13 05:46:41,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-04-13 05:46:41,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-04-13 05:46:41,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-04-13 05:46:41,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2018-04-13 05:46:41,824 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 10 [2018-04-13 05:46:41,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:46:41,825 INFO L459 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2018-04-13 05:46:41,825 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-04-13 05:46:41,825 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2018-04-13 05:46:41,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-04-13 05:46:41,825 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:46:41,826 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:46:41,826 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-13 05:46:41,826 INFO L82 PathProgramCache]: Analyzing trace with hash 117051847, now seen corresponding path program 1 times [2018-04-13 05:46:41,826 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:46:41,826 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:46:41,827 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:46:41,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:46:41,827 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:46:41,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:46:41,837 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:46:41,882 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-13 05:46:41,882 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 05:46:41,882 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 05:46:41,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-13 05:46:41,884 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-13 05:46:41,884 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-13 05:46:41,884 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand 3 states. [2018-04-13 05:46:41,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:46:41,925 INFO L93 Difference]: Finished difference Result 150 states and 156 transitions. [2018-04-13 05:46:41,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-13 05:46:41,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-04-13 05:46:41,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:46:41,927 INFO L225 Difference]: With dead ends: 150 [2018-04-13 05:46:41,927 INFO L226 Difference]: Without dead ends: 150 [2018-04-13 05:46:41,928 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-13 05:46:41,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-04-13 05:46:41,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 126. [2018-04-13 05:46:41,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-04-13 05:46:41,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 156 transitions. [2018-04-13 05:46:41,936 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 156 transitions. Word has length 12 [2018-04-13 05:46:41,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:46:41,936 INFO L459 AbstractCegarLoop]: Abstraction has 126 states and 156 transitions. [2018-04-13 05:46:41,936 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-13 05:46:41,936 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 156 transitions. [2018-04-13 05:46:41,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-13 05:46:41,937 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:46:41,937 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:46:41,937 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-13 05:46:41,937 INFO L82 PathProgramCache]: Analyzing trace with hash -666360665, now seen corresponding path program 1 times [2018-04-13 05:46:41,937 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:46:41,937 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:46:41,938 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:46:41,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:46:41,938 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:46:41,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:46:41,949 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:46:41,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:46:41,961 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 05:46:41,961 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-13 05:46:41,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-13 05:46:41,962 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-13 05:46:41,962 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-13 05:46:41,962 INFO L87 Difference]: Start difference. First operand 126 states and 156 transitions. Second operand 3 states. [2018-04-13 05:46:42,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:46:42,026 INFO L93 Difference]: Finished difference Result 128 states and 157 transitions. [2018-04-13 05:46:42,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-13 05:46:42,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-04-13 05:46:42,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:46:42,027 INFO L225 Difference]: With dead ends: 128 [2018-04-13 05:46:42,027 INFO L226 Difference]: Without dead ends: 124 [2018-04-13 05:46:42,027 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-13 05:46:42,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-04-13 05:46:42,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-04-13 05:46:42,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-04-13 05:46:42,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 153 transitions. [2018-04-13 05:46:42,032 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 153 transitions. Word has length 13 [2018-04-13 05:46:42,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:46:42,033 INFO L459 AbstractCegarLoop]: Abstraction has 124 states and 153 transitions. [2018-04-13 05:46:42,033 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-13 05:46:42,033 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 153 transitions. [2018-04-13 05:46:42,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-13 05:46:42,033 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:46:42,033 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:46:42,033 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-13 05:46:42,033 INFO L82 PathProgramCache]: Analyzing trace with hash -667226745, now seen corresponding path program 1 times [2018-04-13 05:46:42,033 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:46:42,033 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:46:42,034 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:46:42,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:46:42,034 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:46:42,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:46:42,043 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:46:42,059 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-13 05:46:42,060 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 05:46:42,060 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 05:46:42,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 05:46:42,060 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 05:46:42,060 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 05:46:42,060 INFO L87 Difference]: Start difference. First operand 124 states and 153 transitions. Second operand 4 states. [2018-04-13 05:46:42,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:46:42,209 INFO L93 Difference]: Finished difference Result 145 states and 168 transitions. [2018-04-13 05:46:42,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-13 05:46:42,210 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-04-13 05:46:42,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:46:42,211 INFO L225 Difference]: With dead ends: 145 [2018-04-13 05:46:42,211 INFO L226 Difference]: Without dead ends: 145 [2018-04-13 05:46:42,211 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-13 05:46:42,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-04-13 05:46:42,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 116. [2018-04-13 05:46:42,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-04-13 05:46:42,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 138 transitions. [2018-04-13 05:46:42,217 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 138 transitions. Word has length 13 [2018-04-13 05:46:42,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:46:42,217 INFO L459 AbstractCegarLoop]: Abstraction has 116 states and 138 transitions. [2018-04-13 05:46:42,217 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 05:46:42,217 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 138 transitions. [2018-04-13 05:46:42,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-13 05:46:42,218 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:46:42,218 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:46:42,218 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-13 05:46:42,218 INFO L82 PathProgramCache]: Analyzing trace with hash -667226744, now seen corresponding path program 1 times [2018-04-13 05:46:42,218 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:46:42,218 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:46:42,219 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:46:42,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:46:42,219 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:46:42,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:46:42,228 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:46:42,260 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-13 05:46:42,260 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 05:46:42,260 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 05:46:42,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 05:46:42,261 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 05:46:42,261 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 05:46:42,261 INFO L87 Difference]: Start difference. First operand 116 states and 138 transitions. Second operand 4 states. [2018-04-13 05:46:42,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:46:42,355 INFO L93 Difference]: Finished difference Result 160 states and 182 transitions. [2018-04-13 05:46:42,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-13 05:46:42,356 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-04-13 05:46:42,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:46:42,356 INFO L225 Difference]: With dead ends: 160 [2018-04-13 05:46:42,356 INFO L226 Difference]: Without dead ends: 160 [2018-04-13 05:46:42,356 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-13 05:46:42,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-04-13 05:46:42,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 117. [2018-04-13 05:46:42,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-04-13 05:46:42,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 138 transitions. [2018-04-13 05:46:42,361 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 138 transitions. Word has length 13 [2018-04-13 05:46:42,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:46:42,362 INFO L459 AbstractCegarLoop]: Abstraction has 117 states and 138 transitions. [2018-04-13 05:46:42,362 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 05:46:42,362 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 138 transitions. [2018-04-13 05:46:42,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-13 05:46:42,362 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:46:42,362 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:46:42,362 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-13 05:46:42,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1900820966, now seen corresponding path program 1 times [2018-04-13 05:46:42,363 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:46:42,363 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:46:42,363 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:46:42,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:46:42,363 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:46:42,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:46:42,380 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:46:42,386 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 05:46:42,386 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:46:42,386 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:46:42,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:46:42,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:46:42,416 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:46:42,464 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:42,471 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 14 treesize of output 24 [2018-04-13 05:46:42,473 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 05:46:42,484 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 2 xjuncts. [2018-04-13 05:46:42,485 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:32 [2018-04-13 05:46:42,506 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-13 05:46:42,506 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 05:46:42,506 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-13 05:46:42,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-13 05:46:42,506 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-13 05:46:42,506 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-04-13 05:46:42,507 INFO L87 Difference]: Start difference. First operand 117 states and 138 transitions. Second operand 7 states. [2018-04-13 05:46:42,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:46:42,710 INFO L93 Difference]: Finished difference Result 191 states and 213 transitions. [2018-04-13 05:46:42,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-13 05:46:42,712 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-04-13 05:46:42,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:46:42,713 INFO L225 Difference]: With dead ends: 191 [2018-04-13 05:46:42,713 INFO L226 Difference]: Without dead ends: 191 [2018-04-13 05:46:42,713 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2018-04-13 05:46:42,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-04-13 05:46:42,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 115. [2018-04-13 05:46:42,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-04-13 05:46:42,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 134 transitions. [2018-04-13 05:46:42,719 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 134 transitions. Word has length 25 [2018-04-13 05:46:42,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:46:42,719 INFO L459 AbstractCegarLoop]: Abstraction has 115 states and 134 transitions. [2018-04-13 05:46:42,720 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-13 05:46:42,720 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 134 transitions. [2018-04-13 05:46:42,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-13 05:46:42,720 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:46:42,720 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] [2018-04-13 05:46:42,720 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-13 05:46:42,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1204092197, now seen corresponding path program 1 times [2018-04-13 05:46:42,721 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:46:42,721 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:46:42,722 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:46:42,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:46:42,722 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:46:42,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:46:42,734 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:46:42,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:46:42,760 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 05:46:42,760 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 05:46:42,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 05:46:42,760 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 05:46:42,761 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 05:46:42,761 INFO L87 Difference]: Start difference. First operand 115 states and 134 transitions. Second operand 4 states. [2018-04-13 05:46:42,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:46:42,895 INFO L93 Difference]: Finished difference Result 167 states and 187 transitions. [2018-04-13 05:46:42,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-13 05:46:42,895 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-04-13 05:46:42,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:46:42,897 INFO L225 Difference]: With dead ends: 167 [2018-04-13 05:46:42,897 INFO L226 Difference]: Without dead ends: 167 [2018-04-13 05:46:42,897 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-13 05:46:42,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-04-13 05:46:42,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 111. [2018-04-13 05:46:42,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-04-13 05:46:42,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 126 transitions. [2018-04-13 05:46:42,902 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 126 transitions. Word has length 26 [2018-04-13 05:46:42,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:46:42,902 INFO L459 AbstractCegarLoop]: Abstraction has 111 states and 126 transitions. [2018-04-13 05:46:42,902 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 05:46:42,902 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 126 transitions. [2018-04-13 05:46:42,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-13 05:46:42,903 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:46:42,903 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] [2018-04-13 05:46:42,903 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-13 05:46:42,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1204092198, now seen corresponding path program 1 times [2018-04-13 05:46:42,903 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:46:42,903 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:46:42,904 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:46:42,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:46:42,904 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:46:42,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:46:42,915 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:46:42,950 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-13 05:46:42,950 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 05:46:42,950 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 05:46:42,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 05:46:42,951 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 05:46:42,951 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 05:46:42,951 INFO L87 Difference]: Start difference. First operand 111 states and 126 transitions. Second operand 4 states. [2018-04-13 05:46:43,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:46:43,020 INFO L93 Difference]: Finished difference Result 149 states and 161 transitions. [2018-04-13 05:46:43,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-13 05:46:43,020 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-04-13 05:46:43,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:46:43,021 INFO L225 Difference]: With dead ends: 149 [2018-04-13 05:46:43,021 INFO L226 Difference]: Without dead ends: 149 [2018-04-13 05:46:43,021 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-13 05:46:43,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-04-13 05:46:43,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 107. [2018-04-13 05:46:43,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-04-13 05:46:43,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 118 transitions. [2018-04-13 05:46:43,024 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 118 transitions. Word has length 26 [2018-04-13 05:46:43,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:46:43,024 INFO L459 AbstractCegarLoop]: Abstraction has 107 states and 118 transitions. [2018-04-13 05:46:43,024 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 05:46:43,025 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 118 transitions. [2018-04-13 05:46:43,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-13 05:46:43,025 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:46:43,025 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:46:43,025 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-13 05:46:43,026 INFO L82 PathProgramCache]: Analyzing trace with hash -230772510, now seen corresponding path program 1 times [2018-04-13 05:46:43,026 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:46:43,026 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:46:43,026 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:46:43,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:46:43,027 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:46:43,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:46:43,035 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:46:43,055 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:46:43,055 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 05:46:43,055 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 05:46:43,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 05:46:43,055 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 05:46:43,056 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 05:46:43,056 INFO L87 Difference]: Start difference. First operand 107 states and 118 transitions. Second operand 4 states. [2018-04-13 05:46:43,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:46:43,128 INFO L93 Difference]: Finished difference Result 137 states and 147 transitions. [2018-04-13 05:46:43,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 05:46:43,128 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-04-13 05:46:43,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:46:43,129 INFO L225 Difference]: With dead ends: 137 [2018-04-13 05:46:43,129 INFO L226 Difference]: Without dead ends: 137 [2018-04-13 05:46:43,129 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-13 05:46:43,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-04-13 05:46:43,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 110. [2018-04-13 05:46:43,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-04-13 05:46:43,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 123 transitions. [2018-04-13 05:46:43,131 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 123 transitions. Word has length 28 [2018-04-13 05:46:43,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:46:43,131 INFO L459 AbstractCegarLoop]: Abstraction has 110 states and 123 transitions. [2018-04-13 05:46:43,131 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 05:46:43,131 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 123 transitions. [2018-04-13 05:46:43,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-13 05:46:43,132 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:46:43,132 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:46:43,132 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-13 05:46:43,132 INFO L82 PathProgramCache]: Analyzing trace with hash -230772509, now seen corresponding path program 1 times [2018-04-13 05:46:43,132 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:46:43,132 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:46:43,132 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:46:43,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:46:43,133 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:46:43,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:46:43,138 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:46:43,181 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:46:43,181 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 05:46:43,181 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 05:46:43,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 05:46:43,181 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 05:46:43,181 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-13 05:46:43,182 INFO L87 Difference]: Start difference. First operand 110 states and 123 transitions. Second operand 5 states. [2018-04-13 05:46:43,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:46:43,286 INFO L93 Difference]: Finished difference Result 185 states and 204 transitions. [2018-04-13 05:46:43,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 05:46:43,286 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-04-13 05:46:43,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:46:43,287 INFO L225 Difference]: With dead ends: 185 [2018-04-13 05:46:43,287 INFO L226 Difference]: Without dead ends: 185 [2018-04-13 05:46:43,287 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-13 05:46:43,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-04-13 05:46:43,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 136. [2018-04-13 05:46:43,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-04-13 05:46:43,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 156 transitions. [2018-04-13 05:46:43,290 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 156 transitions. Word has length 28 [2018-04-13 05:46:43,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:46:43,291 INFO L459 AbstractCegarLoop]: Abstraction has 136 states and 156 transitions. [2018-04-13 05:46:43,291 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 05:46:43,291 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 156 transitions. [2018-04-13 05:46:43,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-13 05:46:43,291 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:46:43,291 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:46:43,292 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-13 05:46:43,292 INFO L82 PathProgramCache]: Analyzing trace with hash -456182561, now seen corresponding path program 1 times [2018-04-13 05:46:43,292 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:46:43,292 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:46:43,292 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:46:43,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:46:43,292 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:46:43,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:46:43,301 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:46:43,304 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 05:46:43,304 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:46:43,305 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:46:43,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:46:43,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:46:43,329 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:46:43,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 05:46:43,334 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:43,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:43,335 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-13 05:46:43,344 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-13 05:46:43,344 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:43,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:43,345 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:5, output treesize:1 [2018-04-13 05:46:43,349 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-13 05:46:43,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 05:46:43,351 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:43,352 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:43,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:43,354 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-04-13 05:46:43,362 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 21 treesize of output 16 [2018-04-13 05:46:43,372 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:43,373 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 16 treesize of output 23 [2018-04-13 05:46:43,373 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:43,378 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:43,380 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:43,381 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2018-04-13 05:46:43,420 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 32 treesize of output 40 [2018-04-13 05:46:43,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2018-04-13 05:46:43,423 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:43,434 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:43,438 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-13 05:46:43,438 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:33 [2018-04-13 05:46:43,454 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 35 treesize of output 33 [2018-04-13 05:46:43,459 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:43,460 INFO L477 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 10 [2018-04-13 05:46:43,460 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:43,467 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:43,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:43,469 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:40, output treesize:5 [2018-04-13 05:46:43,476 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-13 05:46:43,476 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 05:46:43,476 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-13 05:46:43,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-13 05:46:43,476 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-13 05:46:43,477 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-04-13 05:46:43,477 INFO L87 Difference]: Start difference. First operand 136 states and 156 transitions. Second operand 9 states. [2018-04-13 05:46:43,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:46:43,777 INFO L93 Difference]: Finished difference Result 243 states and 264 transitions. [2018-04-13 05:46:43,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-13 05:46:43,778 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-04-13 05:46:43,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:46:43,778 INFO L225 Difference]: With dead ends: 243 [2018-04-13 05:46:43,778 INFO L226 Difference]: Without dead ends: 243 [2018-04-13 05:46:43,779 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2018-04-13 05:46:43,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-04-13 05:46:43,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 152. [2018-04-13 05:46:43,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-04-13 05:46:43,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 174 transitions. [2018-04-13 05:46:43,781 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 174 transitions. Word has length 29 [2018-04-13 05:46:43,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:46:43,781 INFO L459 AbstractCegarLoop]: Abstraction has 152 states and 174 transitions. [2018-04-13 05:46:43,781 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-13 05:46:43,781 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 174 transitions. [2018-04-13 05:46:43,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-13 05:46:43,781 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:46:43,782 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:46:43,782 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-13 05:46:43,782 INFO L82 PathProgramCache]: Analyzing trace with hash -456182560, now seen corresponding path program 1 times [2018-04-13 05:46:43,782 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:46:43,782 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:46:43,782 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:46:43,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:46:43,782 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:46:43,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:46:43,789 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:46:43,791 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 05:46:43,791 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:46:43,791 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:46:43,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:46:43,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:46:43,811 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:46:43,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 05:46:43,820 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:43,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:43,824 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 05:46:43,846 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-13 05:46:43,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, 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-13 05:46:43,847 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:43,849 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:43,855 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-13 05:46:43,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 05:46:43,856 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:43,857 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:43,862 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:43,862 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2018-04-13 05:46:43,877 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 21 treesize of output 16 [2018-04-13 05:46:43,880 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:43,881 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 16 treesize of output 23 [2018-04-13 05:46:43,882 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:43,885 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:43,893 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 21 treesize of output 16 [2018-04-13 05:46:43,895 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:43,896 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 16 treesize of output 23 [2018-04-13 05:46:43,896 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:43,901 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:43,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:43,907 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:49, output treesize:41 [2018-04-13 05:46:43,941 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:43,948 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 12 treesize of output 15 [2018-04-13 05:46:43,948 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 05:46:43,962 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 2 xjuncts. [2018-04-13 05:46:43,962 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:47, output treesize:88 [2018-04-13 05:46:44,031 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 69 treesize of output 77 [2018-04-13 05:46:44,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 69 [2018-04-13 05:46:44,034 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:44,062 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:44,095 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 65 treesize of output 73 [2018-04-13 05:46:44,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 65 [2018-04-13 05:46:44,104 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:44,141 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:44,172 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 64 treesize of output 72 [2018-04-13 05:46:44,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 64 [2018-04-13 05:46:44,175 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:44,210 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:44,237 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 60 treesize of output 68 [2018-04-13 05:46:44,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 60 [2018-04-13 05:46:44,240 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:44,284 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:44,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-13 05:46:44,303 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:134, output treesize:118 [2018-04-13 05:46:44,343 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 70 treesize of output 68 [2018-04-13 05:46:44,347 INFO L477 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 41 [2018-04-13 05:46:44,347 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:44,367 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:44,387 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 41 treesize of output 39 [2018-04-13 05:46:44,390 INFO L477 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 12 [2018-04-13 05:46:44,391 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:44,407 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:44,428 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 75 treesize of output 73 [2018-04-13 05:46:44,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 62 [2018-04-13 05:46:44,431 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:44,460 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 62 treesize of output 50 [2018-04-13 05:46:44,460 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:44,491 INFO L477 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 46 [2018-04-13 05:46:44,492 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:44,506 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:44,549 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 46 treesize of output 44 [2018-04-13 05:46:44,553 INFO L477 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 17 [2018-04-13 05:46:44,553 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:44,572 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:44,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-13 05:46:44,581 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 11 variables, input treesize:146, output treesize:24 [2018-04-13 05:46:44,601 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-13 05:46:44,601 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 05:46:44,601 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-13 05:46:44,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-13 05:46:44,602 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-13 05:46:44,602 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=66, Unknown=4, NotChecked=0, Total=90 [2018-04-13 05:46:44,602 INFO L87 Difference]: Start difference. First operand 152 states and 174 transitions. Second operand 10 states. [2018-04-13 05:46:44,852 WARN L151 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 65 DAG size of output 65 [2018-04-13 05:46:45,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:46:45,075 INFO L93 Difference]: Finished difference Result 194 states and 216 transitions. [2018-04-13 05:46:45,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-13 05:46:45,076 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2018-04-13 05:46:45,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:46:45,077 INFO L225 Difference]: With dead ends: 194 [2018-04-13 05:46:45,077 INFO L226 Difference]: Without dead ends: 194 [2018-04-13 05:46:45,077 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=186, Unknown=4, NotChecked=0, Total=240 [2018-04-13 05:46:45,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-04-13 05:46:45,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 152. [2018-04-13 05:46:45,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-04-13 05:46:45,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 172 transitions. [2018-04-13 05:46:45,081 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 172 transitions. Word has length 29 [2018-04-13 05:46:45,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:46:45,081 INFO L459 AbstractCegarLoop]: Abstraction has 152 states and 172 transitions. [2018-04-13 05:46:45,081 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-13 05:46:45,081 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 172 transitions. [2018-04-13 05:46:45,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-13 05:46:45,082 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:46:45,082 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:46:45,082 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-13 05:46:45,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1435986156, now seen corresponding path program 1 times [2018-04-13 05:46:45,082 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:46:45,082 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:46:45,083 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:46:45,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:46:45,083 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:46:45,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:46:45,090 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:46:45,108 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:46:45,108 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 05:46:45,108 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-13 05:46:45,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 05:46:45,109 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 05:46:45,109 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-13 05:46:45,109 INFO L87 Difference]: Start difference. First operand 152 states and 172 transitions. Second operand 5 states. [2018-04-13 05:46:45,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:46:45,166 INFO L93 Difference]: Finished difference Result 156 states and 168 transitions. [2018-04-13 05:46:45,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 05:46:45,167 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-04-13 05:46:45,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:46:45,167 INFO L225 Difference]: With dead ends: 156 [2018-04-13 05:46:45,167 INFO L226 Difference]: Without dead ends: 156 [2018-04-13 05:46:45,168 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-13 05:46:45,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-04-13 05:46:45,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 152. [2018-04-13 05:46:45,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-04-13 05:46:45,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 167 transitions. [2018-04-13 05:46:45,171 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 167 transitions. Word has length 29 [2018-04-13 05:46:45,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:46:45,171 INFO L459 AbstractCegarLoop]: Abstraction has 152 states and 167 transitions. [2018-04-13 05:46:45,171 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 05:46:45,171 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 167 transitions. [2018-04-13 05:46:45,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-13 05:46:45,172 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:46:45,172 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:46:45,172 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-13 05:46:45,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1565919907, now seen corresponding path program 1 times [2018-04-13 05:46:45,173 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:46:45,173 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:46:45,173 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:46:45,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:46:45,173 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:46:45,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:46:45,180 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:46:45,192 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-13 05:46:45,193 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 05:46:45,193 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 05:46:45,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 05:46:45,193 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 05:46:45,193 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 05:46:45,193 INFO L87 Difference]: Start difference. First operand 152 states and 167 transitions. Second operand 4 states. [2018-04-13 05:46:45,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:46:45,260 INFO L93 Difference]: Finished difference Result 166 states and 182 transitions. [2018-04-13 05:46:45,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 05:46:45,260 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-04-13 05:46:45,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:46:45,261 INFO L225 Difference]: With dead ends: 166 [2018-04-13 05:46:45,261 INFO L226 Difference]: Without dead ends: 166 [2018-04-13 05:46:45,262 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-13 05:46:45,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-04-13 05:46:45,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 155. [2018-04-13 05:46:45,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-04-13 05:46:45,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 172 transitions. [2018-04-13 05:46:45,265 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 172 transitions. Word has length 30 [2018-04-13 05:46:45,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:46:45,265 INFO L459 AbstractCegarLoop]: Abstraction has 155 states and 172 transitions. [2018-04-13 05:46:45,265 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 05:46:45,265 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 172 transitions. [2018-04-13 05:46:45,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-13 05:46:45,266 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:46:45,266 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:46:45,266 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-13 05:46:45,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1565919908, now seen corresponding path program 1 times [2018-04-13 05:46:45,266 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:46:45,266 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:46:45,267 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:46:45,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:46:45,267 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:46:45,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:46:45,273 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:46:45,325 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:46:45,325 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 05:46:45,325 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-13 05:46:45,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-13 05:46:45,326 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-13 05:46:45,326 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-13 05:46:45,326 INFO L87 Difference]: Start difference. First operand 155 states and 172 transitions. Second operand 6 states. [2018-04-13 05:46:45,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:46:45,496 INFO L93 Difference]: Finished difference Result 228 states and 248 transitions. [2018-04-13 05:46:45,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-13 05:46:45,496 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-04-13 05:46:45,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:46:45,497 INFO L225 Difference]: With dead ends: 228 [2018-04-13 05:46:45,497 INFO L226 Difference]: Without dead ends: 228 [2018-04-13 05:46:45,498 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-04-13 05:46:45,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-04-13 05:46:45,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 169. [2018-04-13 05:46:45,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-04-13 05:46:45,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 192 transitions. [2018-04-13 05:46:45,501 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 192 transitions. Word has length 30 [2018-04-13 05:46:45,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:46:45,502 INFO L459 AbstractCegarLoop]: Abstraction has 169 states and 192 transitions. [2018-04-13 05:46:45,502 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-13 05:46:45,502 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 192 transitions. [2018-04-13 05:46:45,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-13 05:46:45,502 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:46:45,502 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:46:45,502 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-13 05:46:45,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1482847976, now seen corresponding path program 1 times [2018-04-13 05:46:45,503 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:46:45,503 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:46:45,503 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:46:45,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:46:45,504 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:46:45,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:46:45,510 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:46:45,512 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 05:46:45,512 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:46:45,512 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:46:45,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:46:45,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:46:45,531 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:46:45,542 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-13 05:46:45,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 05:46:45,545 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:45,546 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:45,553 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-13 05:46:45,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 05:46:45,555 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:45,561 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:45,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:45,566 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:18 [2018-04-13 05:46:45,577 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 21 treesize of output 16 [2018-04-13 05:46:45,588 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:45,589 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 16 treesize of output 23 [2018-04-13 05:46:45,589 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:45,594 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:45,604 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 21 treesize of output 16 [2018-04-13 05:46:45,609 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:45,610 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 16 treesize of output 23 [2018-04-13 05:46:45,610 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:45,614 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:45,621 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:45,621 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2018-04-13 05:46:45,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-04-13 05:46:45,661 INFO L477 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-04-13 05:46:45,661 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:45,664 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:45,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-04-13 05:46:45,670 INFO L477 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-04-13 05:46:45,670 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:45,673 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:45,676 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:45,676 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:49, output treesize:10 [2018-04-13 05:46:45,705 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:46:45,706 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 05:46:45,706 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-13 05:46:45,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-13 05:46:45,706 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-13 05:46:45,706 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-04-13 05:46:45,707 INFO L87 Difference]: Start difference. First operand 169 states and 192 transitions. Second operand 10 states. [2018-04-13 05:46:45,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:46:45,973 INFO L93 Difference]: Finished difference Result 252 states and 280 transitions. [2018-04-13 05:46:45,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-13 05:46:45,974 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-04-13 05:46:45,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:46:45,975 INFO L225 Difference]: With dead ends: 252 [2018-04-13 05:46:45,975 INFO L226 Difference]: Without dead ends: 252 [2018-04-13 05:46:45,975 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=266, Unknown=0, NotChecked=0, Total=380 [2018-04-13 05:46:45,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-04-13 05:46:45,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 180. [2018-04-13 05:46:45,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-04-13 05:46:45,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 204 transitions. [2018-04-13 05:46:45,979 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 204 transitions. Word has length 34 [2018-04-13 05:46:45,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:46:45,979 INFO L459 AbstractCegarLoop]: Abstraction has 180 states and 204 transitions. [2018-04-13 05:46:45,979 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-13 05:46:45,979 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 204 transitions. [2018-04-13 05:46:45,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-13 05:46:45,980 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:46:45,980 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-13 05:46:45,980 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-13 05:46:45,980 INFO L82 PathProgramCache]: Analyzing trace with hash 794616337, now seen corresponding path program 1 times [2018-04-13 05:46:45,980 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:46:45,980 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:46:45,981 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:46:45,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:46:45,981 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:46:45,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:46:45,990 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:46:45,993 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 05:46:45,993 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:46:45,993 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:46:45,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:46:46,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:46:46,014 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:46:46,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-13 05:46:46,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, 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-13 05:46:46,033 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:46,036 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:46,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, 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-13 05:46:46,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, 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-13 05:46:46,047 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:46,048 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:46,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:46,051 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2018-04-13 05:46:46,061 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 23 treesize of output 18 [2018-04-13 05:46:46,063 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:46,064 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 18 treesize of output 27 [2018-04-13 05:46:46,064 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:46,068 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:46,076 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 23 treesize of output 18 [2018-04-13 05:46:46,078 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:46,078 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 18 treesize of output 27 [2018-04-13 05:46:46,079 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:46,082 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:46,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:46,087 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:45, output treesize:37 [2018-04-13 05:46:46,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-04-13 05:46:46,099 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:46,099 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:46,100 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:46,102 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-13 05:46:46,103 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:46,108 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:46,116 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 30 treesize of output 23 [2018-04-13 05:46:46,117 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:46,118 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:46,118 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:46,119 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-13 05:46:46,120 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:46,139 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:46,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:46,146 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:59, output treesize:51 [2018-04-13 05:46:46,158 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 39 treesize of output 30 [2018-04-13 05:46:46,161 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:46,161 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:46,162 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:46,163 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:46,163 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:46,164 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:46,168 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 30 treesize of output 77 [2018-04-13 05:46:46,168 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:46,179 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:46,191 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 39 treesize of output 30 [2018-04-13 05:46:46,193 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:46,194 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:46,194 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:46,195 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:46,195 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:46,196 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:46,200 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 30 treesize of output 77 [2018-04-13 05:46:46,200 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:46,213 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:46,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:46,220 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:77, output treesize:69 [2018-04-13 05:46:46,263 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 44 treesize of output 34 [2018-04-13 05:46:46,268 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:46,268 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:46,269 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:46,269 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:46,270 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:46,270 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:46,273 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 34 treesize of output 46 [2018-04-13 05:46:46,273 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:46,279 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:46,285 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-13 05:46:46,285 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:87, output treesize:47 [2018-04-13 05:46:46,308 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 51 treesize of output 39 [2018-04-13 05:46:46,310 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:46,311 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:46,311 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:46,312 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:46,313 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:46,314 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:46,328 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 4 case distinctions, treesize of input 39 treesize of output 84 [2018-04-13 05:46:46,329 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-04-13 05:46:46,358 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-13 05:46:46,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-13 05:46:46,374 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:28 [2018-04-13 05:46:46,391 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:46:46,391 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 05:46:46,391 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-04-13 05:46:46,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-13 05:46:46,392 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-13 05:46:46,392 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-04-13 05:46:46,392 INFO L87 Difference]: Start difference. First operand 180 states and 204 transitions. Second operand 11 states. [2018-04-13 05:46:46,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:46:46,723 INFO L93 Difference]: Finished difference Result 196 states and 215 transitions. [2018-04-13 05:46:46,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-13 05:46:46,723 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 39 [2018-04-13 05:46:46,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:46:46,723 INFO L225 Difference]: With dead ends: 196 [2018-04-13 05:46:46,723 INFO L226 Difference]: Without dead ends: 196 [2018-04-13 05:46:46,724 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2018-04-13 05:46:46,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-04-13 05:46:46,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 185. [2018-04-13 05:46:46,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-04-13 05:46:46,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 209 transitions. [2018-04-13 05:46:46,726 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 209 transitions. Word has length 39 [2018-04-13 05:46:46,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:46:46,726 INFO L459 AbstractCegarLoop]: Abstraction has 185 states and 209 transitions. [2018-04-13 05:46:46,726 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-13 05:46:46,726 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 209 transitions. [2018-04-13 05:46:46,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-13 05:46:46,726 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:46:46,727 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:46:46,727 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-13 05:46:46,727 INFO L82 PathProgramCache]: Analyzing trace with hash 932480026, now seen corresponding path program 1 times [2018-04-13 05:46:46,727 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:46:46,727 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:46:46,727 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:46:46,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:46:46,727 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:46:46,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:46:46,732 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:46:46,734 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 05:46:46,734 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:46:46,734 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:46:46,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:46:46,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:46:46,744 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:46:46,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 6 treesize of output 5 [2018-04-13 05:46:46,759 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:46,760 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:46,760 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-13 05:46:46,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-13 05:46:46,769 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:46,771 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-13 05:46:46,771 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-04-13 05:46:46,775 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:46:46,775 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 05:46:46,775 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-04-13 05:46:46,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 05:46:46,776 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 05:46:46,776 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-13 05:46:46,776 INFO L87 Difference]: Start difference. First operand 185 states and 209 transitions. Second operand 5 states. [2018-04-13 05:46:46,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:46:46,846 INFO L93 Difference]: Finished difference Result 211 states and 235 transitions. [2018-04-13 05:46:46,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 05:46:46,846 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-04-13 05:46:46,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:46:46,847 INFO L225 Difference]: With dead ends: 211 [2018-04-13 05:46:46,847 INFO L226 Difference]: Without dead ends: 211 [2018-04-13 05:46:46,847 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-13 05:46:46,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-04-13 05:46:46,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 184. [2018-04-13 05:46:46,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-04-13 05:46:46,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 206 transitions. [2018-04-13 05:46:46,851 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 206 transitions. Word has length 39 [2018-04-13 05:46:46,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:46:46,851 INFO L459 AbstractCegarLoop]: Abstraction has 184 states and 206 transitions. [2018-04-13 05:46:46,851 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 05:46:46,851 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 206 transitions. [2018-04-13 05:46:46,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-13 05:46:46,852 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:46:46,852 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:46:46,852 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-13 05:46:46,852 INFO L82 PathProgramCache]: Analyzing trace with hash 932480027, now seen corresponding path program 1 times [2018-04-13 05:46:46,852 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:46:46,852 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:46:46,853 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:46:46,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:46:46,853 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:46:46,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:46:46,861 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:46:46,863 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 05:46:46,863 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:46:46,864 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:46:46,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:46:46,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:46:46,880 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:46:46,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, 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-13 05:46:46,890 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:46,893 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:46,893 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 05:46:46,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-13 05:46:46,915 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:46,919 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-13 05:46:46,919 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-04-13 05:46:46,927 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:46:46,927 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 05:46:46,927 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-04-13 05:46:46,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 05:46:46,928 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 05:46:46,928 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-13 05:46:46,928 INFO L87 Difference]: Start difference. First operand 184 states and 206 transitions. Second operand 5 states. [2018-04-13 05:46:47,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:46:47,022 INFO L93 Difference]: Finished difference Result 241 states and 267 transitions. [2018-04-13 05:46:47,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 05:46:47,022 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-04-13 05:46:47,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:46:47,023 INFO L225 Difference]: With dead ends: 241 [2018-04-13 05:46:47,023 INFO L226 Difference]: Without dead ends: 241 [2018-04-13 05:46:47,023 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-13 05:46:47,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-04-13 05:46:47,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 202. [2018-04-13 05:46:47,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-04-13 05:46:47,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 225 transitions. [2018-04-13 05:46:47,027 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 225 transitions. Word has length 39 [2018-04-13 05:46:47,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:46:47,027 INFO L459 AbstractCegarLoop]: Abstraction has 202 states and 225 transitions. [2018-04-13 05:46:47,027 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 05:46:47,028 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 225 transitions. [2018-04-13 05:46:47,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-13 05:46:47,028 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:46:47,028 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] [2018-04-13 05:46:47,028 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-13 05:46:47,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1136697955, now seen corresponding path program 1 times [2018-04-13 05:46:47,028 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:46:47,028 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:46:47,029 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:46:47,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:46:47,029 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:46:47,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:46:47,036 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:46:47,037 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 05:46:47,037 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:46:47,037 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:46:47,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:46:47,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:46:47,052 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:46:47,112 WARN L1033 $PredicateComparison]: unable to prove that (exists ((main_~x~1.base Int)) (and (= |c_#valid| (store |c_old(#valid)| main_~x~1.base 0)) (= 0 (select |c_old(#valid)| main_~x~1.base)))) is different from true [2018-04-13 05:46:47,118 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-04-13 05:46:47,118 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 05:46:47,118 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-04-13 05:46:47,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-13 05:46:47,119 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-13 05:46:47,119 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=32, Unknown=1, NotChecked=10, Total=56 [2018-04-13 05:46:47,119 INFO L87 Difference]: Start difference. First operand 202 states and 225 transitions. Second operand 8 states. [2018-04-13 05:46:47,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:46:47,337 INFO L93 Difference]: Finished difference Result 205 states and 227 transitions. [2018-04-13 05:46:47,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-13 05:46:47,337 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2018-04-13 05:46:47,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:46:47,338 INFO L225 Difference]: With dead ends: 205 [2018-04-13 05:46:47,338 INFO L226 Difference]: Without dead ends: 190 [2018-04-13 05:46:47,339 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=93, Unknown=2, NotChecked=20, Total=156 [2018-04-13 05:46:47,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-04-13 05:46:47,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2018-04-13 05:46:47,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-04-13 05:46:47,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 211 transitions. [2018-04-13 05:46:47,342 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 211 transitions. Word has length 40 [2018-04-13 05:46:47,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:46:47,342 INFO L459 AbstractCegarLoop]: Abstraction has 189 states and 211 transitions. [2018-04-13 05:46:47,342 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-13 05:46:47,342 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 211 transitions. [2018-04-13 05:46:47,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-13 05:46:47,343 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:46:47,343 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] [2018-04-13 05:46:47,343 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-13 05:46:47,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1024639304, now seen corresponding path program 1 times [2018-04-13 05:46:47,343 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:46:47,343 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:46:47,344 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:46:47,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:46:47,344 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:46:47,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:46:47,354 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:46:47,357 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 05:46:47,357 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:46:47,357 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:46:47,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:46:47,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:46:47,385 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:46:47,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 05:46:47,390 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:47,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:47,393 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 05:46:47,413 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-13 05:46:47,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 05:46:47,415 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:47,417 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:47,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:47,423 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-04-13 05:46:47,435 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 7 treesize of output 5 [2018-04-13 05:46:47,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, 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-13 05:46:47,438 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:47,439 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:47,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:47,443 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-04-13 05:46:47,454 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:47,455 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:47,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-04-13 05:46:47,456 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:47,463 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:47,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-13 05:46:47,464 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:47,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:47,470 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:14 [2018-04-13 05:46:47,510 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:46:47,511 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 05:46:47,511 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-04-13 05:46:47,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-13 05:46:47,511 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-13 05:46:47,511 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-04-13 05:46:47,511 INFO L87 Difference]: Start difference. First operand 189 states and 211 transitions. Second operand 9 states. [2018-04-13 05:46:47,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:46:47,820 INFO L93 Difference]: Finished difference Result 277 states and 307 transitions. [2018-04-13 05:46:47,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-13 05:46:47,821 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 44 [2018-04-13 05:46:47,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:46:47,822 INFO L225 Difference]: With dead ends: 277 [2018-04-13 05:46:47,822 INFO L226 Difference]: Without dead ends: 277 [2018-04-13 05:46:47,822 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2018-04-13 05:46:47,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-04-13 05:46:47,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 194. [2018-04-13 05:46:47,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-04-13 05:46:47,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 217 transitions. [2018-04-13 05:46:47,826 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 217 transitions. Word has length 44 [2018-04-13 05:46:47,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:46:47,827 INFO L459 AbstractCegarLoop]: Abstraction has 194 states and 217 transitions. [2018-04-13 05:46:47,827 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-13 05:46:47,827 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 217 transitions. [2018-04-13 05:46:47,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-13 05:46:47,827 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:46:47,828 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:46:47,828 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-13 05:46:47,828 INFO L82 PathProgramCache]: Analyzing trace with hash 703750570, now seen corresponding path program 1 times [2018-04-13 05:46:47,828 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:46:47,828 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:46:47,829 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:46:47,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:46:47,829 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:46:47,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:46:47,837 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:46:47,839 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 05:46:47,840 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:46:47,840 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:46:47,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:46:47,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:46:47,873 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:46:47,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-13 05:46:47,881 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:47,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:47,884 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-13 05:46:47,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-13 05:46:47,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 05:46:47,898 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:47,900 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:47,904 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-13 05:46:47,904 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2018-04-13 05:46:47,915 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:47,915 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:47,916 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:47,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 26 treesize of output 38 [2018-04-13 05:46:47,917 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:47,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-13 05:46:47,925 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:32 [2018-04-13 05:46:47,964 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 3 case distinctions, treesize of input 33 treesize of output 41 [2018-04-13 05:46:47,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, 1 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-13 05:46:47,967 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:47,991 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:47,999 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-13 05:46:47,999 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:43 [2018-04-13 05:46:48,022 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 1 case distinctions, treesize of input 36 treesize of output 34 [2018-04-13 05:46:48,028 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 30 treesize of output 23 [2018-04-13 05:46:48,029 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:48,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2018-04-13 05:46:48,042 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:48,054 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 26 treesize of output 10 [2018-04-13 05:46:48,054 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:48,061 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:48,068 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 05:46:48,068 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:50, output treesize:24 [2018-04-13 05:46:48,085 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:46:48,086 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 05:46:48,086 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-04-13 05:46:48,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-13 05:46:48,086 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-13 05:46:48,087 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-04-13 05:46:48,087 INFO L87 Difference]: Start difference. First operand 194 states and 217 transitions. Second operand 10 states. [2018-04-13 05:46:48,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:46:48,564 INFO L93 Difference]: Finished difference Result 242 states and 268 transitions. [2018-04-13 05:46:48,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-13 05:46:48,567 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2018-04-13 05:46:48,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:46:48,568 INFO L225 Difference]: With dead ends: 242 [2018-04-13 05:46:48,568 INFO L226 Difference]: Without dead ends: 242 [2018-04-13 05:46:48,568 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2018-04-13 05:46:48,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-04-13 05:46:48,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 193. [2018-04-13 05:46:48,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-04-13 05:46:48,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 215 transitions. [2018-04-13 05:46:48,572 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 215 transitions. Word has length 45 [2018-04-13 05:46:48,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:46:48,572 INFO L459 AbstractCegarLoop]: Abstraction has 193 states and 215 transitions. [2018-04-13 05:46:48,572 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-13 05:46:48,572 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 215 transitions. [2018-04-13 05:46:48,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-13 05:46:48,573 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:46:48,573 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:46:48,573 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-13 05:46:48,573 INFO L82 PathProgramCache]: Analyzing trace with hash 703750571, now seen corresponding path program 1 times [2018-04-13 05:46:48,573 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:46:48,573 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:46:48,574 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:46:48,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:46:48,574 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:46:48,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:46:48,586 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:46:48,588 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 05:46:48,589 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:46:48,589 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:46:48,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:46:48,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:46:48,641 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:46:48,672 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-13 05:46:48,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 05:46:48,674 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:48,676 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:48,683 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-13 05:46:48,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 05:46:48,685 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:48,686 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:48,691 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-13 05:46:48,691 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2018-04-13 05:46:48,708 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2018-04-13 05:46:48,709 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 05:46:48,718 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-13 05:46:48,719 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:22 [2018-04-13 05:46:48,761 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 25 treesize of output 35 [2018-04-13 05:46:48,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-04-13 05:46:48,764 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:48,780 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:48,802 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 23 treesize of output 33 [2018-04-13 05:46:48,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-04-13 05:46:48,805 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:48,825 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:48,833 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-13 05:46:48,833 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:52, output treesize:44 [2018-04-13 05:46:48,857 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 28 treesize of output 28 [2018-04-13 05:46:48,860 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 24 treesize of output 17 [2018-04-13 05:46:48,860 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:48,872 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 10 [2018-04-13 05:46:48,872 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:48,884 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 5 [2018-04-13 05:46:48,884 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:48,888 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:48,901 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 26 treesize of output 26 [2018-04-13 05:46:48,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 22 treesize of output 15 [2018-04-13 05:46:48,903 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:48,915 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 18 treesize of output 3 [2018-04-13 05:46:48,916 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:48,920 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:48,924 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-13 05:46:48,924 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:58, output treesize:14 [2018-04-13 05:46:48,941 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:46:48,941 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 05:46:48,941 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-04-13 05:46:48,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-13 05:46:48,942 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-13 05:46:48,942 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=70, Unknown=1, NotChecked=0, Total=90 [2018-04-13 05:46:48,942 INFO L87 Difference]: Start difference. First operand 193 states and 215 transitions. Second operand 10 states. [2018-04-13 05:46:49,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:46:49,369 INFO L93 Difference]: Finished difference Result 262 states and 288 transitions. [2018-04-13 05:46:49,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-13 05:46:49,370 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2018-04-13 05:46:49,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:46:49,371 INFO L225 Difference]: With dead ends: 262 [2018-04-13 05:46:49,371 INFO L226 Difference]: Without dead ends: 262 [2018-04-13 05:46:49,371 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=275, Unknown=3, NotChecked=0, Total=380 [2018-04-13 05:46:49,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-04-13 05:46:49,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 176. [2018-04-13 05:46:49,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-04-13 05:46:49,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 197 transitions. [2018-04-13 05:46:49,374 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 197 transitions. Word has length 45 [2018-04-13 05:46:49,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:46:49,375 INFO L459 AbstractCegarLoop]: Abstraction has 176 states and 197 transitions. [2018-04-13 05:46:49,375 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-13 05:46:49,375 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 197 transitions. [2018-04-13 05:46:49,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-13 05:46:49,375 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:46:49,375 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] [2018-04-13 05:46:49,375 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-13 05:46:49,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1130858695, now seen corresponding path program 1 times [2018-04-13 05:46:49,376 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:46:49,376 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:46:49,376 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:46:49,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:46:49,377 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:46:49,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:46:49,385 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:46:49,446 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-13 05:46:49,446 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 05:46:49,447 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-13 05:46:49,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-13 05:46:49,447 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-13 05:46:49,447 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-04-13 05:46:49,447 INFO L87 Difference]: Start difference. First operand 176 states and 197 transitions. Second operand 7 states. [2018-04-13 05:46:49,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:46:49,561 INFO L93 Difference]: Finished difference Result 204 states and 226 transitions. [2018-04-13 05:46:49,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-13 05:46:49,562 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2018-04-13 05:46:49,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:46:49,563 INFO L225 Difference]: With dead ends: 204 [2018-04-13 05:46:49,563 INFO L226 Difference]: Without dead ends: 204 [2018-04-13 05:46:49,563 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-04-13 05:46:49,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-04-13 05:46:49,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 173. [2018-04-13 05:46:49,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-04-13 05:46:49,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 194 transitions. [2018-04-13 05:46:49,566 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 194 transitions. Word has length 46 [2018-04-13 05:46:49,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:46:49,567 INFO L459 AbstractCegarLoop]: Abstraction has 173 states and 194 transitions. [2018-04-13 05:46:49,567 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-13 05:46:49,567 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 194 transitions. [2018-04-13 05:46:49,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-13 05:46:49,567 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:46:49,567 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] [2018-04-13 05:46:49,567 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-13 05:46:49,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1086492925, now seen corresponding path program 1 times [2018-04-13 05:46:49,568 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:46:49,568 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:46:49,571 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:46:49,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:46:49,571 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:46:49,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:46:49,580 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:46:49,630 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:46:49,630 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 05:46:49,630 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-13 05:46:49,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-13 05:46:49,630 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-13 05:46:49,630 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-04-13 05:46:49,634 INFO L87 Difference]: Start difference. First operand 173 states and 194 transitions. Second operand 8 states. [2018-04-13 05:46:49,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:46:49,812 INFO L93 Difference]: Finished difference Result 212 states and 233 transitions. [2018-04-13 05:46:49,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-13 05:46:49,813 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2018-04-13 05:46:49,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:46:49,813 INFO L225 Difference]: With dead ends: 212 [2018-04-13 05:46:49,814 INFO L226 Difference]: Without dead ends: 212 [2018-04-13 05:46:49,814 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-04-13 05:46:49,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-04-13 05:46:49,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 182. [2018-04-13 05:46:49,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-04-13 05:46:49,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 205 transitions. [2018-04-13 05:46:49,817 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 205 transitions. Word has length 50 [2018-04-13 05:46:49,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:46:49,818 INFO L459 AbstractCegarLoop]: Abstraction has 182 states and 205 transitions. [2018-04-13 05:46:49,818 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-13 05:46:49,818 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 205 transitions. [2018-04-13 05:46:49,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-13 05:46:49,818 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:46:49,819 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] [2018-04-13 05:46:49,819 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-13 05:46:49,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1086492926, now seen corresponding path program 1 times [2018-04-13 05:46:49,819 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:46:49,819 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:46:49,820 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:46:49,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:46:49,820 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:46:49,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:46:49,829 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:46:49,920 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:46:49,921 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 05:46:49,921 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-13 05:46:49,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-13 05:46:49,921 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-13 05:46:49,921 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-04-13 05:46:49,921 INFO L87 Difference]: Start difference. First operand 182 states and 205 transitions. Second operand 9 states. [2018-04-13 05:46:50,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:46:50,192 INFO L93 Difference]: Finished difference Result 311 states and 346 transitions. [2018-04-13 05:46:50,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-13 05:46:50,193 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2018-04-13 05:46:50,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:46:50,193 INFO L225 Difference]: With dead ends: 311 [2018-04-13 05:46:50,194 INFO L226 Difference]: Without dead ends: 311 [2018-04-13 05:46:50,194 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-04-13 05:46:50,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-04-13 05:46:50,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 182. [2018-04-13 05:46:50,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-04-13 05:46:50,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 204 transitions. [2018-04-13 05:46:50,196 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 204 transitions. Word has length 50 [2018-04-13 05:46:50,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:46:50,196 INFO L459 AbstractCegarLoop]: Abstraction has 182 states and 204 transitions. [2018-04-13 05:46:50,196 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-13 05:46:50,197 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 204 transitions. [2018-04-13 05:46:50,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-13 05:46:50,197 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:46:50,197 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-13 05:46:50,197 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-13 05:46:50,197 INFO L82 PathProgramCache]: Analyzing trace with hash 442651197, now seen corresponding path program 1 times [2018-04-13 05:46:50,197 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:46:50,197 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:46:50,198 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:46:50,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:46:50,198 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:46:50,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:46:50,204 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:46:50,280 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:46:50,281 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 05:46:50,281 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-13 05:46:50,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-13 05:46:50,281 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-13 05:46:50,281 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-04-13 05:46:50,281 INFO L87 Difference]: Start difference. First operand 182 states and 204 transitions. Second operand 10 states. [2018-04-13 05:46:50,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:46:50,586 INFO L93 Difference]: Finished difference Result 369 states and 406 transitions. [2018-04-13 05:46:50,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-13 05:46:50,586 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2018-04-13 05:46:50,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:46:50,587 INFO L225 Difference]: With dead ends: 369 [2018-04-13 05:46:50,587 INFO L226 Difference]: Without dead ends: 369 [2018-04-13 05:46:50,587 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2018-04-13 05:46:50,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-04-13 05:46:50,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 184. [2018-04-13 05:46:50,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-04-13 05:46:50,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 206 transitions. [2018-04-13 05:46:50,590 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 206 transitions. Word has length 52 [2018-04-13 05:46:50,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:46:50,590 INFO L459 AbstractCegarLoop]: Abstraction has 184 states and 206 transitions. [2018-04-13 05:46:50,590 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-13 05:46:50,590 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 206 transitions. [2018-04-13 05:46:50,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-13 05:46:50,590 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:46:50,590 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, 1] [2018-04-13 05:46:50,590 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-13 05:46:50,591 INFO L82 PathProgramCache]: Analyzing trace with hash 837285383, now seen corresponding path program 1 times [2018-04-13 05:46:50,591 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:46:50,591 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:46:50,591 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:46:50,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:46:50,591 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:46:50,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:46:50,599 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:46:50,616 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-04-13 05:46:50,616 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 05:46:50,616 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 05:46:50,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 05:46:50,616 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 05:46:50,616 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 05:46:50,616 INFO L87 Difference]: Start difference. First operand 184 states and 206 transitions. Second operand 4 states. [2018-04-13 05:46:50,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:46:50,643 INFO L93 Difference]: Finished difference Result 183 states and 204 transitions. [2018-04-13 05:46:50,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 05:46:50,644 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2018-04-13 05:46:50,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:46:50,644 INFO L225 Difference]: With dead ends: 183 [2018-04-13 05:46:50,644 INFO L226 Difference]: Without dead ends: 183 [2018-04-13 05:46:50,645 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-13 05:46:50,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-04-13 05:46:50,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-04-13 05:46:50,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-04-13 05:46:50,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 204 transitions. [2018-04-13 05:46:50,646 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 204 transitions. Word has length 53 [2018-04-13 05:46:50,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:46:50,646 INFO L459 AbstractCegarLoop]: Abstraction has 183 states and 204 transitions. [2018-04-13 05:46:50,646 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 05:46:50,647 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 204 transitions. [2018-04-13 05:46:50,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-13 05:46:50,647 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:46:50,647 INFO L355 BasicCegarLoop]: trace histogram [3, 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] [2018-04-13 05:46:50,647 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-13 05:46:50,647 INFO L82 PathProgramCache]: Analyzing trace with hash -2106709023, now seen corresponding path program 1 times [2018-04-13 05:46:50,647 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:46:50,647 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:46:50,648 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:46:50,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:46:50,648 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:46:50,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:46:50,654 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:46:50,657 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 05:46:50,657 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:46:50,657 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:46:50,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:46:50,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:46:50,690 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:46:50,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 6 treesize of output 5 [2018-04-13 05:46:50,700 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:50,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:50,704 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 05:46:50,717 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-13 05:46:50,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 05:46:50,719 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:50,720 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:50,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 11 treesize of output 8 [2018-04-13 05:46:50,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 05:46:50,732 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:50,734 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:50,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:50,740 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:23 [2018-04-13 05:46:50,754 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 21 treesize of output 16 [2018-04-13 05:46:50,757 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:50,758 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 16 treesize of output 23 [2018-04-13 05:46:50,758 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:50,763 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:50,772 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 21 treesize of output 16 [2018-04-13 05:46:50,774 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:50,775 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 16 treesize of output 23 [2018-04-13 05:46:50,775 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:50,778 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:50,784 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:50,785 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:49, output treesize:41 [2018-04-13 05:46:50,810 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:50,810 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:50,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 11 treesize of output 12 [2018-04-13 05:46:50,811 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:50,819 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:50,819 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:48, output treesize:42 [2018-04-13 05:46:50,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-04-13 05:46: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 10 treesize of output 9 [2018-04-13 05:46:50,859 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:50,866 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:50,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-04-13 05:46:50,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 10 treesize of output 9 [2018-04-13 05:46:50,888 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:50,892 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:50,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:50,901 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:68, output treesize:60 [2018-04-13 05:46:50,922 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 37 treesize of output 36 [2018-04-13 05:46:50,924 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:50,925 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 18 treesize of output 27 [2018-04-13 05:46:50,925 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:50,932 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:50,949 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 37 treesize of output 36 [2018-04-13 05:46:50,951 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:50,952 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 18 treesize of output 27 [2018-04-13 05:46:50,952 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:50,957 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:50,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:50,969 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:86, output treesize:78 [2018-04-13 05:46:50,992 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 41 [2018-04-13 05:46:50,994 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:50,994 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:50,995 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:50,997 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-13 05:46:50,998 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:51,007 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:51,027 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 41 [2018-04-13 05:46:51,029 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:51,030 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:51,030 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:51,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, 5 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-13 05:46:51,032 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:51,040 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:51,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:51,054 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:100, output treesize:92 [2018-04-13 05:46:51,084 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 53 treesize of output 48 [2018-04-13 05:46:51,086 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:51,087 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:51,088 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:51,088 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:51,089 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:51,089 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:51,093 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 30 treesize of output 77 [2018-04-13 05:46:51,093 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:51,106 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:51,130 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 53 treesize of output 48 [2018-04-13 05:46:51,131 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:51,132 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:51,132 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:51,133 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:51,133 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:51,134 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:51,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 77 [2018-04-13 05:46:51,136 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:51,147 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:51,164 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:51,164 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:118, output treesize:110 [2018-04-13 05:46:51,209 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 59 [2018-04-13 05:46:51,211 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:51,212 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:51,214 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 36 [2018-04-13 05:46:51,214 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:51,226 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:51,255 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 59 [2018-04-13 05:46:51,268 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:51,269 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:51,270 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 21 treesize of output 36 [2018-04-13 05:46:51,270 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:51,281 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:51,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:51,302 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:136, output treesize:128 [2018-04-13 05:46:51,353 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 265 treesize of output 234 [2018-04-13 05:46:51,357 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:51,358 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:51,358 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:51,361 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:51,361 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:51,362 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:51,371 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 85 treesize of output 209 [2018-04-13 05:46:51,371 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:51,400 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:51,431 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 244 treesize of output 206 [2018-04-13 05:46:51,433 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:51,434 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:51,434 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:51,435 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:51,435 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:51,436 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:51,438 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:51,441 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 85 treesize of output 231 [2018-04-13 05:46:51,442 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:51,491 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:51,549 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-13 05:46:51,549 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:295, output treesize:245 [2018-04-13 05:46:51,633 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:51,634 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 232 treesize of output 189 [2018-04-13 05:46:51,638 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:51,639 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:51,640 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:51,641 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:51,645 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 73 treesize of output 123 [2018-04-13 05:46:51,645 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:51,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 97 [2018-04-13 05:46:51,672 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-13 05:46:51,686 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-13 05:46:51,704 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 92 treesize of output 70 [2018-04-13 05:46:51,706 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:51,707 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:51,707 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:51,708 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:51,708 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:51,709 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:51,713 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 51 treesize of output 91 [2018-04-13 05:46:51,714 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:51,723 INFO L477 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-04-13 05:46:51,723 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:51,725 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:51,730 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-13 05:46:51,730 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:262, output treesize:10 [2018-04-13 05:46:51,769 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:46:51,769 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 05:46:51,769 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-13 05:46:51,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-13 05:46:51,770 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-13 05:46:51,770 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2018-04-13 05:46:51,770 INFO L87 Difference]: Start difference. First operand 183 states and 204 transitions. Second operand 18 states. [2018-04-13 05:46:55,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:46:55,236 INFO L93 Difference]: Finished difference Result 269 states and 291 transitions. [2018-04-13 05:46:55,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-13 05:46:55,236 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 53 [2018-04-13 05:46:55,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:46:55,236 INFO L225 Difference]: With dead ends: 269 [2018-04-13 05:46:55,237 INFO L226 Difference]: Without dead ends: 269 [2018-04-13 05:46:55,237 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=273, Invalid=1059, Unknown=0, NotChecked=0, Total=1332 [2018-04-13 05:46:55,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-04-13 05:46:55,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 210. [2018-04-13 05:46:55,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-04-13 05:46:55,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 233 transitions. [2018-04-13 05:46:55,239 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 233 transitions. Word has length 53 [2018-04-13 05:46:55,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:46:55,239 INFO L459 AbstractCegarLoop]: Abstraction has 210 states and 233 transitions. [2018-04-13 05:46:55,240 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-13 05:46:55,240 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 233 transitions. [2018-04-13 05:46:55,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-13 05:46:55,240 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:46:55,240 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] [2018-04-13 05:46:55,240 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-13 05:46:55,240 INFO L82 PathProgramCache]: Analyzing trace with hash 80923932, now seen corresponding path program 1 times [2018-04-13 05:46:55,241 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:46:55,241 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:46:55,241 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:46:55,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:46:55,242 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:46:55,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:46:55,250 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:46:55,309 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:46:55,309 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:46:55,309 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:46:55,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:46:55,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:46:55,334 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:46:55,372 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-13 05:46:55,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 8 treesize of output 7 [2018-04-13 05:46:55,373 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:55,375 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:55,380 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:55,380 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:16 [2018-04-13 05:46:55,399 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 7 treesize of output 5 [2018-04-13 05:46:55,400 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-13 05:46:55,400 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:55,401 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:55,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:55,404 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:9 [2018-04-13 05:46:55,407 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:55,408 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:55,408 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-04-13 05:46:55,409 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:55,412 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:55,412 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-04-13 05:46:55,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-13 05:46:55,438 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 8 treesize of output 7 [2018-04-13 05:46:55,438 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:55,439 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:55,442 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-13 05:46:55,443 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:12 [2018-04-13 05:46:55,492 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 16 treesize of output 12 [2018-04-13 05:46:55,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 13 [2018-04-13 05:46:55,497 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 05:46:55,499 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 05:46:55,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 05:46:55,502 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:17 [2018-04-13 05:46:55,560 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:46:55,560 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:46:55,561 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14] total 22 [2018-04-13 05:46:55,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-13 05:46:55,561 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-13 05:46:55,561 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2018-04-13 05:46:55,562 INFO L87 Difference]: Start difference. First operand 210 states and 233 transitions. Second operand 22 states. [2018-04-13 05:46:56,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:46:56,312 INFO L93 Difference]: Finished difference Result 363 states and 395 transitions. [2018-04-13 05:46:56,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-13 05:46:56,312 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 55 [2018-04-13 05:46:56,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:46:56,313 INFO L225 Difference]: With dead ends: 363 [2018-04-13 05:46:56,313 INFO L226 Difference]: Without dead ends: 363 [2018-04-13 05:46:56,313 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=317, Invalid=1323, Unknown=0, NotChecked=0, Total=1640 [2018-04-13 05:46:56,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-04-13 05:46:56,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 210. [2018-04-13 05:46:56,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-04-13 05:46:56,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 232 transitions. [2018-04-13 05:46:56,316 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 232 transitions. Word has length 55 [2018-04-13 05:46:56,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:46:56,316 INFO L459 AbstractCegarLoop]: Abstraction has 210 states and 232 transitions. [2018-04-13 05:46:56,316 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-13 05:46:56,316 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 232 transitions. [2018-04-13 05:46:56,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-13 05:46:56,316 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:46:56,317 INFO L355 BasicCegarLoop]: trace histogram [3, 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] [2018-04-13 05:46:56,317 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-13 05:46:56,317 INFO L82 PathProgramCache]: Analyzing trace with hash 218787622, now seen corresponding path program 1 times [2018-04-13 05:46:56,317 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:46:56,317 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:46:56,318 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:46:56,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:46:56,318 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:46:56,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:46:56,328 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:46:56,333 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 05:46:56,333 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:46:56,334 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:46:56,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:46:56,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:46:56,357 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:46:56,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 05:46:56,359 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:56,362 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:56,362 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 05:46:56,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 11 treesize of output 8 [2018-04-13 05:46:56,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, 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-13 05:46:56,387 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:56,388 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:56,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:56,395 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:21 [2018-04-13 05:46:56,406 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 7 treesize of output 5 [2018-04-13 05:46:56,408 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-13 05:46:56,408 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:56,409 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:56,412 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:56,413 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-04-13 05:46:56,416 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:56,417 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:56,417 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-13 05:46:56,417 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:56,425 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:56,426 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:56,426 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-04-13 05:46:56,427 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:56,430 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-13 05:46:56,430 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2018-04-13 05:46:56,468 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:56,471 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:56,476 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 2 case distinctions, treesize of input 17 treesize of output 24 [2018-04-13 05:46:56,477 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 05:46:56,489 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-13 05:46:56,489 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:20, output treesize:38 [2018-04-13 05:46:56,528 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:46:56,529 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 05:46:56,529 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-04-13 05:46:56,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-13 05:46:56,529 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-13 05:46:56,529 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-04-13 05:46:56,529 INFO L87 Difference]: Start difference. First operand 210 states and 232 transitions. Second operand 9 states. [2018-04-13 05:46:56,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:46:56,854 INFO L93 Difference]: Finished difference Result 346 states and 382 transitions. [2018-04-13 05:46:56,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-13 05:46:56,854 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2018-04-13 05:46:56,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:46:56,855 INFO L225 Difference]: With dead ends: 346 [2018-04-13 05:46:56,855 INFO L226 Difference]: Without dead ends: 346 [2018-04-13 05:46:56,855 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2018-04-13 05:46:56,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-04-13 05:46:56,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 191. [2018-04-13 05:46:56,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-04-13 05:46:56,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 210 transitions. [2018-04-13 05:46:56,858 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 210 transitions. Word has length 55 [2018-04-13 05:46:56,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:46:56,859 INFO L459 AbstractCegarLoop]: Abstraction has 191 states and 210 transitions. [2018-04-13 05:46:56,859 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-13 05:46:56,859 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 210 transitions. [2018-04-13 05:46:56,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-13 05:46:56,859 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:46:56,859 INFO L355 BasicCegarLoop]: trace histogram [3, 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] [2018-04-13 05:46:56,860 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-13 05:46:56,860 INFO L82 PathProgramCache]: Analyzing trace with hash -892519642, now seen corresponding path program 2 times [2018-04-13 05:46:56,860 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:46:56,860 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:46:56,860 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:46:56,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:46:56,861 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:46:56,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:46:56,871 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:46:56,875 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 05:46:56,875 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:46:56,875 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:46:56,875 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 05:46:56,898 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 05:46:56,898 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 05:46:56,900 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:46:56,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 05:46:56,908 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:56,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-13 05:46:56,913 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:56,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:56,917 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 05:46:56,943 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:56,944 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-13 05:46:56,944 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:56,954 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:56,954 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:56,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-13 05:46:56,955 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:56,962 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-13 05:46:56,962 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:31 [2018-04-13 05:46:56,984 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:56,985 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:56,985 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:56,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 17 treesize of output 34 [2018-04-13 05:46:56,986 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:57,002 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:57,002 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:57,003 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:57,003 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-13 05:46:57,003 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:57,010 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-13 05:46:57,011 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:42, output treesize:26 [2018-04-13 05:46:57,042 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:46:57,043 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 05:46:57,043 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-04-13 05:46:57,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-13 05:46:57,043 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-13 05:46:57,043 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-13 05:46:57,043 INFO L87 Difference]: Start difference. First operand 191 states and 210 transitions. Second operand 8 states. [2018-04-13 05:46:57,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:46:57,349 INFO L93 Difference]: Finished difference Result 268 states and 295 transitions. [2018-04-13 05:46:57,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-13 05:46:57,349 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2018-04-13 05:46:57,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:46:57,350 INFO L225 Difference]: With dead ends: 268 [2018-04-13 05:46:57,350 INFO L226 Difference]: Without dead ends: 268 [2018-04-13 05:46:57,350 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2018-04-13 05:46:57,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-04-13 05:46:57,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 185. [2018-04-13 05:46:57,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-04-13 05:46:57,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 203 transitions. [2018-04-13 05:46:57,354 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 203 transitions. Word has length 55 [2018-04-13 05:46:57,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:46:57,354 INFO L459 AbstractCegarLoop]: Abstraction has 185 states and 203 transitions. [2018-04-13 05:46:57,354 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-13 05:46:57,354 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 203 transitions. [2018-04-13 05:46:57,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-13 05:46:57,355 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:46:57,355 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] [2018-04-13 05:46:57,355 INFO L408 AbstractCegarLoop]: === Iteration 33 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-13 05:46:57,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1907155547, now seen corresponding path program 1 times [2018-04-13 05:46:57,355 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:46:57,355 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:46:57,356 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:46:57,356 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 05:46:57,356 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:46:57,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:46:57,365 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:46:57,368 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 05:46:57,368 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:46:57,368 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:46:57,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:46:57,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:46:57,408 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:46:57,423 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-13 05:46:57,425 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 05:46:57,425 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:57,426 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:57,436 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-13 05:46:57,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 8 treesize of output 7 [2018-04-13 05:46:57,437 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:57,439 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:57,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:57,445 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:23 [2018-04-13 05:46:57,459 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 21 treesize of output 16 [2018-04-13 05:46:57,461 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:57,462 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 16 treesize of output 23 [2018-04-13 05:46:57,462 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:57,467 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:57,477 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 21 treesize of output 16 [2018-04-13 05:46:57,480 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:57,480 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 16 treesize of output 23 [2018-04-13 05:46:57,480 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:57,484 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:57,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:57,491 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:49, output treesize:41 [2018-04-13 05:46:57,508 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:57,509 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:57,509 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-13 05:46:57,510 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:57,528 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:57,529 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:43 [2018-04-13 05:46:57,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-04-13 05:46:57,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-13 05:46:57,591 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:57,596 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:57,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-04-13 05:46:57,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-13 05:46:57,616 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:57,620 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:57,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:57,632 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:76, output treesize:68 [2018-04-13 05:46:57,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-04-13 05:46:57,674 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:57,694 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:57,694 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 05:46:57,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 72 [2018-04-13 05:46:57,702 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:57,711 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 4 case distinctions, treesize of input 32 treesize of output 61 [2018-04-13 05:46:57,712 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-04-13 05:46:57,748 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-13 05:46:57,786 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 05:46:57,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 87 [2018-04-13 05:46:57,791 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:57,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 74 [2018-04-13 05:46:57,792 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:57,801 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:57,804 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 05:46:57,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 87 [2018-04-13 05:46:57,809 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 05:46:57,810 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:57,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 105 [2018-04-13 05:46:57,811 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:57,824 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:57,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 86 [2018-04-13 05:46:57,834 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:57,834 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:57,835 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:57,836 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 05:46:57,836 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 42 treesize of output 112 [2018-04-13 05:46:57,836 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:57,853 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:57,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-04-13 05:46:57,894 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:119, output treesize:315 [2018-04-13 05:46:57,951 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:57,965 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 145 [2018-04-13 05:46:57,967 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:57,967 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 05:46:57,968 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 45 treesize of output 87 [2018-04-13 05:46:57,968 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:57,990 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:58,086 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:58,088 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 124 treesize of output 128 [2018-04-13 05:46:58,090 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:58,090 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 36 treesize of output 62 [2018-04-13 05:46:58,091 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:58,108 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:58,193 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:58,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, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 127 [2018-04-13 05:46:58,199 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:58,199 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 05:46:58,200 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 37 treesize of output 119 [2018-04-13 05:46:58,200 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:58,218 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:58,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 111 [2018-04-13 05:46:58,317 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:58,337 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 05:46:58,338 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 35 treesize of output 63 [2018-04-13 05:46:58,339 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:58,357 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:58,423 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 142 treesize of output 127 [2018-04-13 05:46:58,425 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:58,425 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 77 treesize of output 94 [2018-04-13 05:46:58,425 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:58,441 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:58,501 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:58,502 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:58,503 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 114 treesize of output 124 [2018-04-13 05:46:58,506 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:58,514 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 65 [2018-04-13 05:46:58,515 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-13 05:46:58,533 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:58,579 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 6 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-04-13 05:46:58,579 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:393, output treesize:421 [2018-04-13 05:46:58,660 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:58,661 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:58,662 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 205 treesize of output 176 [2018-04-13 05:46:58,666 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:58,666 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 181 treesize of output 221 [2018-04-13 05:46:58,667 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:58,703 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:58,802 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:58,803 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 05:46:58,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 194 treesize of output 174 [2018-04-13 05:46:58,808 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:58,809 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:58,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 51 treesize of output 122 [2018-04-13 05:46:58,810 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:58,844 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:58,936 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 05:46:58,948 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 05:46:58,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 252 treesize of output 203 [2018-04-13 05:46:58,964 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:58,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 210 [2018-04-13 05:46:58,965 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:58,992 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:59,066 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:59,067 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 145 treesize of output 125 [2018-04-13 05:46:59,069 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:59,070 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:59,072 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:59,080 INFO L477 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 108 treesize of output 134 [2018-04-13 05:46:59,081 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 05:46:59,125 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 05:46:59,240 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:59,241 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 05:46:59,242 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 05:46:59,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 160 [2018-04-13 05:46:59,246 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:59,247 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 05:46:59,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 102 [2018-04-13 05:46:59,247 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:59,267 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:59,268 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:59,269 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 05:46:59,270 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 05:46:59,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 153 [2018-04-13 05:46:59,274 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:59,275 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 05:46:59,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 42 treesize of output 102 [2018-04-13 05:46:59,276 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-13 05:46:59,295 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:46:59,383 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:59,384 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:59,385 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:59,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, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 191 treesize of output 184 [2018-04-13 05:46:59,388 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:59,392 INFO L477 Elim1Store]: Elim1 applied some 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 1 case distinctions, treesize of input 193 treesize of output 186 [2018-04-13 05:46:59,392 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 05:46:59,410 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 05:46:59,491 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 6 dim-2 vars, End of recursive call: 7 dim-0 vars, and 4 xjuncts. [2018-04-13 05:46:59,491 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 9 variables, input treesize:603, output treesize:664 [2018-04-13 05:46:59,969 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:59,970 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:59,970 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 190 treesize of output 143 [2018-04-13 05:46:59,973 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:46:59,990 INFO L477 Elim1Store]: Elim1 applied some 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 110 [2018-04-13 05:46:59,992 INFO L267 ElimStorePlain]: Start of recursive call 3: 7 dim-0 vars, End of recursive call: 7 dim-0 vars, and 4 xjuncts. [2018-04-13 05:47:00,089 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:00,092 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:00,093 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:00,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 112 treesize of output 153 [2018-04-13 05:47:00,117 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-13 05:47:00,125 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 32 xjuncts. [2018-04-13 05:47:00,133 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:00,135 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:00,136 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:00,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 108 treesize of output 157 [2018-04-13 05:47:00,169 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-04-13 05:47:00,184 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 64 xjuncts. [2018-04-13 05:47:00,192 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:00,194 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:00,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 96 treesize of output 117 [2018-04-13 05:47:00,214 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 8 xjuncts. [2018-04-13 05:47:00,217 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:00,217 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:00,219 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:00,220 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:00,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 112 treesize of output 157 [2018-04-13 05:47:00,246 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-13 05:47:00,285 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 32 xjuncts. [2018-04-13 05:47:01,164 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 12 dim-0 vars, and 12 xjuncts. [2018-04-13 05:47:01,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 77 [2018-04-13 05:47:01,502 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:01,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 19 [2018-04-13 05:47:01,503 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:01,519 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:01,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 23 treesize of output 20 [2018-04-13 05:47:01,520 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:01,530 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:47:01,532 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 82 treesize of output 66 [2018-04-13 05:47:01,534 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:01,535 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 05:47:01,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 60 [2018-04-13 05:47:01,542 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-04-13 05:47:01,566 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:01,566 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 38 treesize of output 20 [2018-04-13 05:47:01,567 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:01,568 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:01,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2018-04-13 05:47:01,568 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:01,581 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 05:47:01,583 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 93 treesize of output 77 [2018-04-13 05:47:01,586 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:01,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, 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 19 [2018-04-13 05:47:01,587 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:01,601 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:01,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 23 treesize of output 20 [2018-04-13 05:47:01,602 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:01,612 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:47:01,616 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 82 treesize of output 66 [2018-04-13 05:47:01,618 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:01,620 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 05:47:01,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 60 [2018-04-13 05:47:01,628 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 2 xjuncts. [2018-04-13 05:47:01,676 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:01,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2018-04-13 05:47:01,677 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:01,678 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:01,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 38 treesize of output 20 [2018-04-13 05:47:01,678 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:01,693 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 05:47:01,695 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 93 treesize of output 77 [2018-04-13 05:47:01,697 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:01,697 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 19 [2018-04-13 05:47:01,697 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:01,713 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:01,714 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 23 treesize of output 20 [2018-04-13 05:47:01,714 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:01,727 INFO L267 ElimStorePlain]: Start of recursive call 22: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:47:01,729 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 93 treesize of output 77 [2018-04-13 05:47:01,731 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:01,731 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 19 [2018-04-13 05:47:01,731 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:01,747 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:01,748 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 23 treesize of output 20 [2018-04-13 05:47:01,748 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:01,758 INFO L267 ElimStorePlain]: Start of recursive call 25: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:47:01,760 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 82 treesize of output 66 [2018-04-13 05:47:01,762 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:01,762 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 19 [2018-04-13 05:47:01,762 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:01,775 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:01,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 28 [2018-04-13 05:47:01,781 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 2 xjuncts. [2018-04-13 05:47:01,794 INFO L267 ElimStorePlain]: Start of recursive call 28: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 05:47:01,796 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 93 treesize of output 77 [2018-04-13 05:47:01,798 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:01,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, 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 19 [2018-04-13 05:47:01,799 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:01,814 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:01,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 23 treesize of output 20 [2018-04-13 05:47:01,816 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:01,826 INFO L267 ElimStorePlain]: Start of recursive call 31: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:47:01,828 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 93 treesize of output 77 [2018-04-13 05:47:01,830 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:01,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 19 [2018-04-13 05:47:01,830 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:01,845 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:01,847 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 23 treesize of output 20 [2018-04-13 05:47:01,847 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:01,857 INFO L267 ElimStorePlain]: Start of recursive call 34: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:47:01,859 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 82 treesize of output 70 [2018-04-13 05:47:01,861 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:01,861 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 19 [2018-04-13 05:47:01,862 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:01,878 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:01,885 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 28 [2018-04-13 05:47:01,885 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 2 xjuncts. [2018-04-13 05:47:01,898 INFO L267 ElimStorePlain]: Start of recursive call 37: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 05:47:01,901 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 93 treesize of output 77 [2018-04-13 05:47:01,902 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:01,903 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 05:47:01,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 34 treesize of output 40 [2018-04-13 05:47:01,904 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:01,917 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:01,918 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 10 [2018-04-13 05:47:01,918 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:01,928 INFO L267 ElimStorePlain]: Start of recursive call 40: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:47:01,930 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 93 treesize of output 77 [2018-04-13 05:47:01,932 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:01,932 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 19 [2018-04-13 05:47:01,932 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:01,948 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:01,952 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 23 treesize of output 20 [2018-04-13 05:47:01,952 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:01,961 INFO L267 ElimStorePlain]: Start of recursive call 43: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:47:02,380 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:02,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 184 treesize of output 154 [2018-04-13 05:47:02,385 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:02,393 INFO L477 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 48 [2018-04-13 05:47:02,393 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 2 xjuncts. [2018-04-13 05:47:02,433 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:02,434 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 72 treesize of output 44 [2018-04-13 05:47:02,434 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:02,436 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:02,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 51 [2018-04-13 05:47:02,437 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:02,467 INFO L267 ElimStorePlain]: Start of recursive call 46: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 05:47:02,761 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:02,761 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:02,762 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 97 treesize of output 78 [2018-04-13 05:47:02,783 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:02,803 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 30 treesize of output 85 [2018-04-13 05:47:02,803 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-13 05:47:02,811 INFO L267 ElimStorePlain]: Start of recursive call 51: 27 dim-0 vars, End of recursive call: 27 dim-0 vars, and 31 xjuncts. [2018-04-13 05:47:02,878 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:02,879 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 26 treesize of output 22 [2018-04-13 05:47:02,879 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:02,881 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:02,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 28 treesize of output 36 [2018-04-13 05:47:02,884 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 2 xjuncts. [2018-04-13 05:47:02,894 INFO L267 ElimStorePlain]: Start of recursive call 50: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:47:02,896 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:02,897 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:02,897 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 90 treesize of output 71 [2018-04-13 05:47:02,903 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:02,932 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 30 treesize of output 93 [2018-04-13 05:47:02,932 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-04-13 05:47:02,941 INFO L267 ElimStorePlain]: Start of recursive call 55: 54 dim-0 vars, End of recursive call: 54 dim-0 vars, and 62 xjuncts. [2018-04-13 05:47:03,104 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:03,104 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-04-13 05:47:03,104 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:03,106 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:03,110 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 42 [2018-04-13 05:47:03,110 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 2 xjuncts. [2018-04-13 05:47:03,111 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:03,111 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2018-04-13 05:47:03,112 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:03,113 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:03,116 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 35 [2018-04-13 05:47:03,117 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 2 xjuncts. [2018-04-13 05:47:03,137 INFO L267 ElimStorePlain]: Start of recursive call 54: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 05:47:03,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 4 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-13 05:47:03,340 INFO L202 ElimStorePlain]: Needed 59 recursive calls to eliminate 9 variables, input treesize:375, output treesize:132 [2018-04-13 05:47:03,499 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:47:03,499 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 05:47:03,499 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-13 05:47:03,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-13 05:47:03,500 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-13 05:47:03,500 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2018-04-13 05:47:03,500 INFO L87 Difference]: Start difference. First operand 185 states and 203 transitions. Second operand 23 states. [2018-04-13 05:47:04,065 WARN L151 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 77 DAG size of output 77 [2018-04-13 05:47:04,328 WARN L151 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 142 DAG size of output 140 [2018-04-13 05:47:04,657 WARN L151 SmtUtils]: Spent 207ms on a formula simplification. DAG size of input: 204 DAG size of output 202 [2018-04-13 05:47:04,890 WARN L151 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 142 DAG size of output 140 [2018-04-13 05:47:05,127 WARN L151 SmtUtils]: Spent 132ms on a formula simplification. DAG size of input: 144 DAG size of output 142 [2018-04-13 05:47:05,314 WARN L151 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 144 DAG size of output 142 [2018-04-13 05:47:05,515 WARN L151 SmtUtils]: Spent 128ms on a formula simplification. DAG size of input: 147 DAG size of output 145 [2018-04-13 05:47:05,721 WARN L151 SmtUtils]: Spent 154ms on a formula simplification. DAG size of input: 159 DAG size of output 154 [2018-04-13 05:47:05,899 WARN L151 SmtUtils]: Spent 131ms on a formula simplification. DAG size of input: 155 DAG size of output 150 [2018-04-13 05:47:06,077 WARN L151 SmtUtils]: Spent 136ms on a formula simplification. DAG size of input: 155 DAG size of output 146 [2018-04-13 05:47:06,279 WARN L151 SmtUtils]: Spent 142ms on a formula simplification. DAG size of input: 151 DAG size of output 143 [2018-04-13 05:47:06,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:47:06,653 INFO L93 Difference]: Finished difference Result 337 states and 363 transitions. [2018-04-13 05:47:06,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-13 05:47:06,654 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 57 [2018-04-13 05:47:06,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:47:06,655 INFO L225 Difference]: With dead ends: 337 [2018-04-13 05:47:06,655 INFO L226 Difference]: Without dead ends: 337 [2018-04-13 05:47:06,656 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 535 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=374, Invalid=1978, Unknown=0, NotChecked=0, Total=2352 [2018-04-13 05:47:06,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-04-13 05:47:06,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 220. [2018-04-13 05:47:06,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-04-13 05:47:06,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 240 transitions. [2018-04-13 05:47:06,660 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 240 transitions. Word has length 57 [2018-04-13 05:47:06,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:47:06,660 INFO L459 AbstractCegarLoop]: Abstraction has 220 states and 240 transitions. [2018-04-13 05:47:06,660 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-13 05:47:06,660 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 240 transitions. [2018-04-13 05:47:06,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-13 05:47:06,660 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:47:06,661 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-13 05:47:06,661 INFO L408 AbstractCegarLoop]: === Iteration 34 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-13 05:47:06,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1007721596, now seen corresponding path program 1 times [2018-04-13 05:47:06,661 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:47:06,661 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:47:06,662 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:47:06,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:47:06,662 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:47:06,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:47:06,670 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:47:06,672 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 05:47:06,672 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:47:06,673 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:47:06,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:47:06,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:47:06,701 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:47:06,764 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:06,765 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 19 treesize of output 24 [2018-04-13 05:47:06,765 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:06,780 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:06,785 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 15 treesize of output 18 [2018-04-13 05:47:06,785 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 05:47:06,802 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 3 xjuncts. [2018-04-13 05:47:06,802 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:38 [2018-04-13 05:47:06,839 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-04-13 05:47:06,840 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 05:47:06,840 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-04-13 05:47:06,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-13 05:47:06,840 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-13 05:47:06,840 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-04-13 05:47:06,841 INFO L87 Difference]: Start difference. First operand 220 states and 240 transitions. Second operand 8 states. [2018-04-13 05:47:07,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:47:07,104 INFO L93 Difference]: Finished difference Result 257 states and 284 transitions. [2018-04-13 05:47:07,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-13 05:47:07,104 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2018-04-13 05:47:07,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:47:07,105 INFO L225 Difference]: With dead ends: 257 [2018-04-13 05:47:07,105 INFO L226 Difference]: Without dead ends: 257 [2018-04-13 05:47:07,105 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-04-13 05:47:07,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-04-13 05:47:07,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 232. [2018-04-13 05:47:07,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-04-13 05:47:07,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 260 transitions. [2018-04-13 05:47:07,108 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 260 transitions. Word has length 58 [2018-04-13 05:47:07,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:47:07,108 INFO L459 AbstractCegarLoop]: Abstraction has 232 states and 260 transitions. [2018-04-13 05:47:07,108 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-13 05:47:07,109 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 260 transitions. [2018-04-13 05:47:07,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-13 05:47:07,109 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:47:07,109 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-04-13 05:47:07,109 INFO L408 AbstractCegarLoop]: === Iteration 35 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-13 05:47:07,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1701339320, now seen corresponding path program 1 times [2018-04-13 05:47:07,109 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:47:07,110 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:47:07,110 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:47:07,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:47:07,110 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:47:07,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:47:07,120 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:47:07,122 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 05:47:07,122 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:47:07,122 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:47:07,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:47:07,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:47:07,151 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:47:07,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 05:47:07,154 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:07,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:47:07,155 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-13 05:47:07,170 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:07,171 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:07,172 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-13 05:47:07,172 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:07,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:47:07,176 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-13 05:47:07,209 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-13 05:47:07,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, 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-13 05:47:07,212 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:07,213 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:47:07,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:47:07,220 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-04-13 05:47:07,240 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-13 05:47:07,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 05:47:07,243 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:07,248 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:47:07,254 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-13 05:47:07,254 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:37 [2018-04-13 05:47:07,283 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 32 [2018-04-13 05:47:07,284 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-13 05:47:07,285 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:07,288 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-13 05:47:07,288 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:07,290 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:47:07,291 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-13 05:47:07,291 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:46, output treesize:10 [2018-04-13 05:47:07,308 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:07,309 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-13 05:47:07,309 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:07,312 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-13 05:47:07,312 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-04-13 05:47:07,327 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:47:07,327 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 05:47:07,327 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-04-13 05:47:07,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-13 05:47:07,328 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-13 05:47:07,328 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-04-13 05:47:07,328 INFO L87 Difference]: Start difference. First operand 232 states and 260 transitions. Second operand 14 states. [2018-04-13 05:47:07,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:47:07,719 INFO L93 Difference]: Finished difference Result 309 states and 336 transitions. [2018-04-13 05:47:07,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-13 05:47:07,719 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 58 [2018-04-13 05:47:07,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:47:07,720 INFO L225 Difference]: With dead ends: 309 [2018-04-13 05:47:07,720 INFO L226 Difference]: Without dead ends: 309 [2018-04-13 05:47:07,720 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=479, Unknown=0, NotChecked=0, Total=600 [2018-04-13 05:47:07,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-04-13 05:47:07,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 280. [2018-04-13 05:47:07,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-04-13 05:47:07,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 314 transitions. [2018-04-13 05:47:07,722 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 314 transitions. Word has length 58 [2018-04-13 05:47:07,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:47:07,722 INFO L459 AbstractCegarLoop]: Abstraction has 280 states and 314 transitions. [2018-04-13 05:47:07,722 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-13 05:47:07,722 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 314 transitions. [2018-04-13 05:47:07,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-13 05:47:07,723 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:47:07,723 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-04-13 05:47:07,723 INFO L408 AbstractCegarLoop]: === Iteration 36 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-13 05:47:07,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1701339321, now seen corresponding path program 1 times [2018-04-13 05:47:07,723 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:47:07,723 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:47:07,723 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:47:07,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:47:07,724 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:47:07,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:47:07,730 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:47:07,732 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 05:47:07,733 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:47:07,733 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:47:07,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:47:07,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:47:07,752 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:47:07,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 05:47:07,763 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:07,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:47:07,764 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-13 05:47:07,775 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:07,776 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:07,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-13 05:47:07,776 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:07,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:47:07,780 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-13 05:47:07,816 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-13 05:47:07,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, 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-13 05:47:07,818 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:07,819 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:47:07,829 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-13 05:47:07,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 05:47:07,831 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:07,832 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:47:07,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:47:07,841 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-04-13 05:47:07,868 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 68 treesize of output 62 [2018-04-13 05:47:07,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-13 05:47:07,869 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:07,875 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:47:07,885 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 33 treesize of output 34 [2018-04-13 05:47:07,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 05:47:07,886 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:07,890 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:47:07,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:47:07,896 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:77, output treesize:57 [2018-04-13 05:47:07,912 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 57 treesize of output 41 [2018-04-13 05:47:07,913 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-13 05:47:07,913 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:07,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 17 [2018-04-13 05:47:07,919 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:07,923 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:47:07,930 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 26 treesize of output 24 [2018-04-13 05:47:07,931 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-13 05:47:07,931 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:07,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-13 05:47:07,935 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:07,936 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:47:07,939 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-13 05:47:07,939 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:75, output treesize:9 [2018-04-13 05:47:07,962 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:47:07,962 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 05:47:07,962 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-04-13 05:47:07,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-13 05:47:07,963 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-13 05:47:07,963 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-04-13 05:47:07,963 INFO L87 Difference]: Start difference. First operand 280 states and 314 transitions. Second operand 12 states. [2018-04-13 05:47:08,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:47:08,360 INFO L93 Difference]: Finished difference Result 330 states and 360 transitions. [2018-04-13 05:47:08,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-13 05:47:08,360 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 58 [2018-04-13 05:47:08,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:47:08,361 INFO L225 Difference]: With dead ends: 330 [2018-04-13 05:47:08,361 INFO L226 Difference]: Without dead ends: 330 [2018-04-13 05:47:08,362 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=347, Unknown=0, NotChecked=0, Total=462 [2018-04-13 05:47:08,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-04-13 05:47:08,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 302. [2018-04-13 05:47:08,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-04-13 05:47:08,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 346 transitions. [2018-04-13 05:47:08,365 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 346 transitions. Word has length 58 [2018-04-13 05:47:08,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:47:08,366 INFO L459 AbstractCegarLoop]: Abstraction has 302 states and 346 transitions. [2018-04-13 05:47:08,366 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-13 05:47:08,366 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 346 transitions. [2018-04-13 05:47:08,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-04-13 05:47:08,366 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:47:08,366 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:47:08,366 INFO L408 AbstractCegarLoop]: === Iteration 37 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-13 05:47:08,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1201910742, now seen corresponding path program 1 times [2018-04-13 05:47:08,367 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:47:08,367 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:47:08,367 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:47:08,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:47:08,368 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:47:08,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:47:08,377 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:47:08,381 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 05:47:08,382 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:47:08,382 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:47:08,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:47:08,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:47:08,407 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:47:08,421 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:08,422 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:08,423 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-04-13 05:47:08,423 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:08,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:47:08,429 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:15 [2018-04-13 05:47:08,452 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-13 05:47:08,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, 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-13 05:47:08,453 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:08,454 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:47:08,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:47:08,458 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-04-13 05:47:08,470 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-13 05:47:08,472 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 05:47:08,472 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:08,475 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:47:08,479 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-13 05:47:08,479 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:36 [2018-04-13 05:47:08,494 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 45 treesize of output 31 [2018-04-13 05:47:08,495 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-13 05:47:08,496 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:08,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, 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-13 05:47:08,500 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:08,502 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:47:08,517 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-13 05:47:08,517 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:45, output treesize:4 [2018-04-13 05:47:08,535 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:47:08,536 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 05:47:08,536 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-04-13 05:47:08,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-13 05:47:08,536 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-13 05:47:08,536 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-04-13 05:47:08,536 INFO L87 Difference]: Start difference. First operand 302 states and 346 transitions. Second operand 10 states. [2018-04-13 05:47:08,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:47:08,859 INFO L93 Difference]: Finished difference Result 327 states and 356 transitions. [2018-04-13 05:47:08,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-13 05:47:08,859 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2018-04-13 05:47:08,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:47:08,860 INFO L225 Difference]: With dead ends: 327 [2018-04-13 05:47:08,860 INFO L226 Difference]: Without dead ends: 327 [2018-04-13 05:47:08,860 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2018-04-13 05:47:08,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-04-13 05:47:08,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 302. [2018-04-13 05:47:08,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-04-13 05:47:08,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 344 transitions. [2018-04-13 05:47:08,862 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 344 transitions. Word has length 59 [2018-04-13 05:47:08,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:47:08,862 INFO L459 AbstractCegarLoop]: Abstraction has 302 states and 344 transitions. [2018-04-13 05:47:08,862 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-13 05:47:08,862 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 344 transitions. [2018-04-13 05:47:08,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-13 05:47:08,862 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:47:08,863 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:47:08,863 INFO L408 AbstractCegarLoop]: === Iteration 38 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-13 05:47:08,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1395450630, now seen corresponding path program 1 times [2018-04-13 05:47:08,863 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:47:08,863 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:47:08,863 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:47:08,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:47:08,863 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:47:08,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:47:08,871 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:47:08,875 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 05:47:08,876 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:47:08,876 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:47:08,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:47:08,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:47:08,899 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:47:08,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-13 05:47:08,908 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:08,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:47:08,909 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-13 05:47:08,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, 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-13 05:47:08,925 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:08,935 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:08,936 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:08,937 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-13 05:47:08,937 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:08,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:47:08,944 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-04-13 05:47:08,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-13 05:47:08,988 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-13 05:47:08,988 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:08,990 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:47:09,000 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-13 05:47:09,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 05:47:09,002 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:09,003 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:47:09,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:47:09,011 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:45, output treesize:37 [2018-04-13 05:47:09,030 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 33 treesize of output 34 [2018-04-13 05:47:09,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, 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-13 05:47:09,032 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:09,045 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:47:09,059 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 58 treesize of output 52 [2018-04-13 05:47:09,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 05:47:09,062 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:09,069 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:47:09,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:47:09,077 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:77, output treesize:57 [2018-04-13 05:47:09,097 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 57 treesize of output 41 [2018-04-13 05:47:09,099 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-13 05:47:09,099 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:09,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 17 [2018-04-13 05:47:09,105 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:09,109 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:47:09,118 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 26 treesize of output 24 [2018-04-13 05:47:09,119 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-13 05:47:09,119 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:09,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-04-13 05:47:09,123 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:09,124 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:47:09,128 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-13 05:47:09,128 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:75, output treesize:9 [2018-04-13 05:47:09,155 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:47:09,155 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 05:47:09,156 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-04-13 05:47:09,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-13 05:47:09,156 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-13 05:47:09,156 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-04-13 05:47:09,156 INFO L87 Difference]: Start difference. First operand 302 states and 344 transitions. Second operand 12 states. [2018-04-13 05:47:09,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:47:09,587 INFO L93 Difference]: Finished difference Result 359 states and 394 transitions. [2018-04-13 05:47:09,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-13 05:47:09,587 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2018-04-13 05:47:09,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:47:09,587 INFO L225 Difference]: With dead ends: 359 [2018-04-13 05:47:09,587 INFO L226 Difference]: Without dead ends: 359 [2018-04-13 05:47:09,588 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2018-04-13 05:47:09,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2018-04-13 05:47:09,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 299. [2018-04-13 05:47:09,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-04-13 05:47:09,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 341 transitions. [2018-04-13 05:47:09,590 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 341 transitions. Word has length 60 [2018-04-13 05:47:09,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:47:09,590 INFO L459 AbstractCegarLoop]: Abstraction has 299 states and 341 transitions. [2018-04-13 05:47:09,590 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-13 05:47:09,590 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 341 transitions. [2018-04-13 05:47:09,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-13 05:47:09,590 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:47:09,590 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] [2018-04-13 05:47:09,591 INFO L408 AbstractCegarLoop]: === Iteration 39 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-13 05:47:09,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1357207938, now seen corresponding path program 1 times [2018-04-13 05:47:09,591 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:47:09,591 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:47:09,591 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:47:09,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:47:09,591 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:47:09,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:47:09,597 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:47:09,600 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 05:47:09,600 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:47:09,600 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:47:09,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:47:09,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:47:09,618 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:47:09,624 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-13 05:47:09,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, 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-13 05:47:09,626 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:09,627 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:47:09,631 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-13 05:47:09,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 05:47:09,633 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:09,642 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:47:09,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:47:09,645 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2018-04-13 05:47:09,651 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 23 treesize of output 18 [2018-04-13 05:47:09,652 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:09,653 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 18 treesize of output 27 [2018-04-13 05:47:09,653 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:09,657 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:47:09,664 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 23 treesize of output 18 [2018-04-13 05:47:09,665 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:09,666 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 18 treesize of output 27 [2018-04-13 05:47:09,666 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:09,669 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:47:09,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:47:09,675 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:45, output treesize:37 [2018-04-13 05:47:09,684 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 30 treesize of output 23 [2018-04-13 05:47:09,686 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:09,686 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:09,687 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:09,689 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-13 05:47:09,689 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:09,695 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:47:09,703 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 30 treesize of output 23 [2018-04-13 05:47:09,704 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:09,705 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:09,705 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:09,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-13 05:47:09,707 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:09,712 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:47:09,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:47:09,717 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:59, output treesize:51 [2018-04-13 05:47:09,727 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 39 treesize of output 30 [2018-04-13 05:47:09,729 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:09,729 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:09,730 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:09,731 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:09,731 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:09,732 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:09,735 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 30 treesize of output 77 [2018-04-13 05:47:09,736 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:09,745 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:47:09,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2018-04-13 05:47:09,758 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:09,759 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:09,759 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:09,760 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:09,760 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:09,760 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:09,763 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 30 treesize of output 77 [2018-04-13 05:47:09,763 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:09,771 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:47:09,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:47:09,780 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:77, output treesize:69 [2018-04-13 05:47:09,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 05:47:09,793 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:09,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:47:09,802 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:74 [2018-04-13 05:47:09,862 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 46 treesize of output 52 [2018-04-13 05:47:09,865 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:09,866 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:09,867 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:09,869 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:09,870 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:09,872 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:09,905 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 8 case distinctions, treesize of input 38 treesize of output 109 [2018-04-13 05:47:09,907 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 16 xjuncts. [2018-04-13 05:47:10,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 42 [2018-04-13 05:47:10,049 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:10,098 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-13 05:47:10,165 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 53 treesize of output 57 [2018-04-13 05:47:10,168 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:10,189 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:10,189 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:10,191 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:10,191 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:10,193 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:10,218 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 8 case distinctions, treesize of input 43 treesize of output 112 [2018-04-13 05:47:10,220 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 16 xjuncts. [2018-04-13 05:47:10,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 49 [2018-04-13 05:47:10,355 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:10,407 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-13 05:47:10,503 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 25 xjuncts. [2018-04-13 05:47:10,503 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:103, output treesize:1940 [2018-04-13 05:47:10,717 WARN L151 SmtUtils]: Spent 198ms on a formula simplification. DAG size of input: 86 DAG size of output 66 [2018-04-13 05:47:10,820 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 106 treesize of output 114 [2018-04-13 05:47:10,822 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 106 [2018-04-13 05:47:10,823 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:10,873 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:47:11,232 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 104 treesize of output 112 [2018-04-13 05:47:11,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 104 [2018-04-13 05:47:11,234 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:11,283 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:47:11,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, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 100 treesize of output 122 [2018-04-13 05:47:11,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, 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 136 [2018-04-13 05:47:11,627 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:11,701 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:11,702 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:11,702 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:11,704 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:11,704 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:11,705 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:11,705 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:11,707 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:11,710 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:11,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 96 treesize of output 177 [2018-04-13 05:47:11,721 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-04-13 05:47:11,835 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-13 05:47:12,229 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 104 treesize of output 112 [2018-04-13 05:47:12,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 105 treesize of output 104 [2018-04-13 05:47:12,232 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:12,281 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:47:12,614 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 100 treesize of output 122 [2018-04-13 05:47:12,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 136 [2018-04-13 05:47:12,616 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:12,689 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:12,690 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:12,691 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:12,692 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:12,692 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:12,693 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:12,693 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:12,695 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:12,697 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:12,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 96 treesize of output 187 [2018-04-13 05:47:12,727 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 6 xjuncts. [2018-04-13 05:47:12,853 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-13 05:47:13,302 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 104 treesize of output 112 [2018-04-13 05:47:13,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 104 [2018-04-13 05:47:13,304 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:13,355 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:47:13,690 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 100 treesize of output 122 [2018-04-13 05:47:13,693 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:13,693 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:13,694 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:13,695 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:13,695 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:13,696 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:13,697 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:13,697 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:13,701 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:13,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 96 treesize of output 177 [2018-04-13 05:47:13,712 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 4 xjuncts. [2018-04-13 05:47:13,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 126 [2018-04-13 05:47:13,848 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:13,917 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-13 05:47:14,299 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 102 treesize of output 124 [2018-04-13 05:47:14,302 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:14,302 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:14,303 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:14,305 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:14,305 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:14,307 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:14,308 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:14,308 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:14,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 98 treesize of output 170 [2018-04-13 05:47:14,321 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 2 xjuncts. [2018-04-13 05:47:14,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 129 treesize of output 128 [2018-04-13 05:47:14,399 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:14,454 INFO L267 ElimStorePlain]: Start of recursive call 19: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:47:14,787 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 118 treesize of output 124 [2018-04-13 05:47:14,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 118 [2018-04-13 05:47:14,789 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:14,844 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:14,845 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:14,846 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:14,847 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:14,848 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:14,849 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:14,849 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:14,851 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:14,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 110 treesize of output 189 [2018-04-13 05:47:14,871 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 4 xjuncts. [2018-04-13 05:47:14,983 INFO L267 ElimStorePlain]: Start of recursive call 22: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-13 05:47:15,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 115 treesize of output 151 [2018-04-13 05:47:15,390 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:15,390 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:15,391 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:15,392 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:15,392 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:15,393 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:15,399 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 136 treesize of output 192 [2018-04-13 05:47:15,400 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:15,480 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:15,481 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:15,482 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:15,485 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:15,486 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:15,487 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:15,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 119 treesize of output 184 [2018-04-13 05:47:15,504 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:15,538 INFO L267 ElimStorePlain]: Start of recursive call 25: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:47:15,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 114 treesize of output 149 [2018-04-13 05:47:15,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 137 treesize of output 136 [2018-04-13 05:47:15,565 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:15,690 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:15,691 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:15,691 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:15,695 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:15,696 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:15,696 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:15,697 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:15,698 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:15,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 10 case distinctions, treesize of input 109 treesize of output 203 [2018-04-13 05:47:15,732 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 16 xjuncts. [2018-04-13 05:47:16,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 116 treesize of output 124 [2018-04-13 05:47:16,009 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 2 xjuncts. [2018-04-13 05:47:16,224 INFO L267 ElimStorePlain]: Start of recursive call 28: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-13 05:47:16,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 115 treesize of output 145 [2018-04-13 05:47:16,247 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:16,247 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:16,248 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:16,248 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 05:47:16,249 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:16,249 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:16,250 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:16,256 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 132 treesize of output 190 [2018-04-13 05:47:16,256 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-04-13 05:47:16,343 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:16,343 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:16,344 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:16,344 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 05:47:16,347 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:16,348 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:16,348 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:47:16,349 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 05:47:16,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 115 treesize of output 186 [2018-04-13 05:47:16,362 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 2 xjuncts. [2018-04-13 05:47:16,424 INFO L267 ElimStorePlain]: Start of recursive call 32: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 05:47:16,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 10 dim-2 vars, End of recursive call: 17 dim-0 vars, and 15 xjuncts. [2018-04-13 05:47:16,875 INFO L202 ElimStorePlain]: Needed 34 recursive calls to eliminate 20 variables, input treesize:537, output treesize:1627 [2018-04-13 05:48:01,813 WARN L151 SmtUtils]: Spent 44884ms on a formula simplification. DAG size of input: 302 DAG size of output 284 [2018-04-13 05:48:01,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 148 treesize of output 165 [2018-04-13 05:48:01,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 153 treesize of output 152 [2018-04-13 05:48:01,873 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 05:48:02,255 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:48:02,256 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:48:02,257 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:48:02,260 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:48:02,261 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:48:02,262 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:48:02,264 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:48:02,268 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:48:02,368 INFO L303 Elim1Store]: Index analysis took 115 ms [2018-04-13 05:48:02,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 137 treesize of output 212 [2018-04-13 05:48:02,392 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-04-13 05:48:02,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 142 treesize of output 143 [2018-04-13 05:48:02,786 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-13 05:48:03,006 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:48:03,007 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:48:03,007 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:48:03,009 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:48:03,009 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:48:03,011 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:48:03,033 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 4 case distinctions, treesize of input 140 treesize of output 205 [2018-04-13 05:48:03,034 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-04-13 05:48:03,203 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-13 05:49:15,749 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 05:49:15,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 118 [2018-04-13 05:49:15,756 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:49:15,756 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:49:15,757 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:49:15,758 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:49:15,758 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:49:15,759 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:49:15,762 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 39 treesize of output 94 [2018-04-13 05:49:15,763 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-13 05:49:15,792 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:50:24,589 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 115 [2018-04-13 05:50:24,591 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:50:24,591 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:50:24,592 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:50:24,592 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:50:24,593 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:50:24,593 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:50:24,594 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:50:24,594 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:50:24,595 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:50:24,596 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:50:24,596 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:50:24,600 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:50:24,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 217 [2018-04-13 05:50:24,602 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-13 05:50:24,635 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:51:27,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 152 treesize of output 148 [2018-04-13 05:51:27,157 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:51:27,158 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:51:27,158 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:51:27,159 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:51:27,160 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:51:27,163 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 05:51:27,166 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 147 treesize of output 184 [2018-04-13 05:51:27,166 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-13 05:51:27,268 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:51:27,268 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:51:27,269 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:51:27,270 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:51:27,271 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:51:27,271 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:51:27,272 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:51:27,273 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:51:27,273 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 05:51:27,278 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 134 treesize of output 213 [2018-04-13 05:51:27,278 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-13 05:51:27,323 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:52:19,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 139 treesize of output 129 [2018-04-13 05:52:19,330 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:52:19,331 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:52:19,331 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:52:19,332 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:52:19,332 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:52:19,333 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:52:19,333 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:52:19,334 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:52:19,334 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:52:19,334 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 05:52:19,344 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 112 treesize of output 211 [2018-04-13 05:52:19,345 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-13 05:52:19,429 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:52:19,429 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:52:19,430 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:52:19,430 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:52:19,431 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:52:19,432 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:52:19,432 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:52:19,433 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:52:19,433 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:52:19,434 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:52:19,435 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:52:19,435 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:52:19,436 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:52:19,436 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 05:52:19,439 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:52:19,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 266 [2018-04-13 05:52:19,442 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-13 05:52:19,516 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 05:53:00,296 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 05:53:00,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 108 [2018-04-13 05:53:00,302 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:53:00,303 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:53:00,304 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:53:00,304 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:53:00,305 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:53:00,306 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:53:00,308 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 37 treesize of output 86 [2018-04-13 05:53:00,308 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-13 05:53:00,340 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:53:28,466 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 96 [2018-04-13 05:53:28,467 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:53:28,468 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:53:28,468 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:53:28,469 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:53:28,469 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:53:28,470 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:53:28,470 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:53:28,471 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:53:28,471 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:53:28,472 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:53:28,472 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:53:28,474 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 05:53:28,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 198 [2018-04-13 05:53:28,475 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-13 05:53:28,504 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:53:49,716 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 05:53:49,718 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 114 [2018-04-13 05:53:49,720 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:53:49,721 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:53:49,722 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:53:49,722 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:53:49,723 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:53:49,724 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:53:49,724 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:53:49,725 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:53:49,725 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:53:49,726 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:53:49,731 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 191 [2018-04-13 05:53:49,731 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-13 05:53:49,761 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:54:08,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 145 treesize of output 152 [2018-04-13 05:54:08,011 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:08,012 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:08,013 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:08,015 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:08,016 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:08,017 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:08,017 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:08,018 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:08,019 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:08,019 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 05:54:08,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 137 treesize of output 242 [2018-04-13 05:54:08,027 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-13 05:54:08,136 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:08,137 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:08,137 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:08,138 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:08,139 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:08,140 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:08,140 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:08,141 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:08,142 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:08,142 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:08,143 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:08,144 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:08,145 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:08,145 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 05:54:08,149 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:08,154 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 282 [2018-04-13 05:54:08,154 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-13 05:54:08,231 INFO L267 ElimStorePlain]: Start of recursive call 23: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 05:54:08,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 145 treesize of output 152 [2018-04-13 05:54:08,256 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:08,257 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:08,257 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:08,258 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:08,259 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:08,259 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:08,260 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:08,260 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:08,261 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:08,262 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:08,262 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:08,263 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 05:54:08,263 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:08,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 269 [2018-04-13 05:54:08,273 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-04-13 05:54:08,392 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:08,393 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:08,393 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:08,394 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:08,395 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:08,396 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:08,396 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:08,397 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:08,398 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:08,399 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:08,399 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:08,400 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:08,401 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:08,402 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:08,402 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 05:54:08,403 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:08,403 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:08,404 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:08,410 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:08,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 329 [2018-04-13 05:54:08,418 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-04-13 05:54:08,462 INFO L267 ElimStorePlain]: Start of recursive call 26: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:54:08,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 144 treesize of output 195 [2018-04-13 05:54:08,499 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:08,500 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 187 treesize of output 220 [2018-04-13 05:54:08,500 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-04-13 05:54:08,751 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:08,751 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:08,752 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:08,755 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:08,755 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:08,756 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:08,757 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:08,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 146 treesize of output 267 [2018-04-13 05:54:08,794 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 4 xjuncts. [2018-04-13 05:54:09,090 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:09,090 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:09,091 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:09,096 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:09,096 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:09,097 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:09,097 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:09,099 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:09,101 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:09,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 13 case distinctions, treesize of input 143 treesize of output 294 [2018-04-13 05:54:09,143 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 16 xjuncts. [2018-04-13 05:54:09,337 INFO L267 ElimStorePlain]: Start of recursive call 29: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-13 05:54:09,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 133 treesize of output 149 [2018-04-13 05:54:09,358 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:09,359 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:09,359 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 05:54:09,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 164 treesize of output 172 [2018-04-13 05:54:09,362 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-04-13 05:54:09,460 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:09,461 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:09,461 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:09,462 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:09,464 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:09,465 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:09,466 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:09,467 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:09,467 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:09,468 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:09,468 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:09,469 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:09,469 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:09,470 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:09,471 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:09,472 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:09,473 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:09,473 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 05:54:09,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 123 treesize of output 245 [2018-04-13 05:54:09,487 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-04-13 05:54:09,575 INFO L267 ElimStorePlain]: Start of recursive call 33: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 05:54:26,910 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 116 [2018-04-13 05:54:26,912 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:26,912 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:26,913 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:26,913 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:26,914 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:26,914 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:26,915 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:26,915 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:26,916 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:26,916 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:26,917 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:26,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 176 [2018-04-13 05:54:26,921 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-04-13 05:54:26,954 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:54:41,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 152 treesize of output 148 [2018-04-13 05:54:41,975 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:41,976 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:41,977 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:41,978 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:41,979 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:41,979 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:41,980 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:41,981 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:41,982 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:41,982 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:41,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 225 [2018-04-13 05:54:41,988 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-04-13 05:54:42,057 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:42,058 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:42,059 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:42,059 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:42,060 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:42,061 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:42,065 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 143 treesize of output 192 [2018-04-13 05:54:42,065 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-04-13 05:54:42,111 INFO L267 ElimStorePlain]: Start of recursive call 38: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:54:54,098 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 150 treesize of output 140 [2018-04-13 05:54:54,108 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:54,109 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:54,109 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:54,110 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:54,111 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:54,111 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:54,112 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:54,112 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:54,113 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:54,114 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:54:54,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 240 [2018-04-13 05:54:54,121 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-04-13 05:54:54,218 INFO L267 ElimStorePlain]: Start of recursive call 41: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:55:03,843 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 05:55:03,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 108 [2018-04-13 05:55:03,848 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:03,849 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:03,850 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:03,850 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:03,851 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:03,851 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 05:55:03,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 37 treesize of output 76 [2018-04-13 05:55:03,862 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-04-13 05:55:03,886 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:55:11,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 96 [2018-04-13 05:55:11,796 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:11,796 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:11,797 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:11,797 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:11,798 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:11,799 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:11,799 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:11,800 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:11,800 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:11,801 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 05:55:11,801 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:11,802 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 05:55:11,805 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 46 treesize of output 182 [2018-04-13 05:55:11,805 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-04-13 05:55:11,836 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:55:18,455 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 05:55:18,472 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 130 treesize of output 135 [2018-04-13 05:55:18,475 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:18,489 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 130 treesize of output 139 [2018-04-13 05:55:18,490 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-04-13 05:55:18,555 INFO L267 ElimStorePlain]: Start of recursive call 47: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:55:23,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 122 treesize of output 142 [2018-04-13 05:55:23,945 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:23,977 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 157 treesize of output 164 [2018-04-13 05:55:23,977 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-04-13 05:55:24,037 INFO L267 ElimStorePlain]: Start of recursive call 49: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:55:28,361 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 05:55:28,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 108 [2018-04-13 05:55:28,366 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:28,367 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:28,368 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:28,368 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:28,369 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:28,369 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:28,372 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 35 treesize of output 84 [2018-04-13 05:55:28,372 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-04-13 05:55:28,407 INFO L267 ElimStorePlain]: Start of recursive call 51: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:55:31,996 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 99 [2018-04-13 05:55:31,998 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:31,999 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:31,999 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:32,000 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:32,001 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:32,001 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:32,002 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:32,003 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:32,003 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:32,004 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:32,007 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:32,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 159 [2018-04-13 05:55:32,010 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-04-13 05:55:32,039 INFO L267 ElimStorePlain]: Start of recursive call 53: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:55:34,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 152 treesize of output 148 [2018-04-13 05:55:34,959 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:34,959 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:34,960 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:34,961 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:34,961 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:34,962 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:34,965 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 147 treesize of output 194 [2018-04-13 05:55:34,965 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-04-13 05:55:35,081 INFO L267 ElimStorePlain]: Start of recursive call 55: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:55:37,453 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 05:55:37,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 154 treesize of output 153 [2018-04-13 05:55:37,470 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 05:55:37,471 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:37,472 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:37,472 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:37,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 156 treesize of output 176 [2018-04-13 05:55:37,478 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-04-13 05:55:37,527 INFO L267 ElimStorePlain]: Start of recursive call 57: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:55:39,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 148 treesize of output 138 [2018-04-13 05:55:39,494 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:39,495 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:39,495 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:39,496 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:39,496 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:39,497 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:39,498 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:39,498 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:39,499 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:39,499 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:39,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 236 [2018-04-13 05:55:39,505 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-04-13 05:55:39,571 INFO L267 ElimStorePlain]: Start of recursive call 59: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:55:41,115 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 05:55:41,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, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 145 treesize of output 118 [2018-04-13 05:55:41,126 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 05:55:41,127 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:41,128 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:41,128 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:41,129 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:41,129 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:41,130 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:41,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 55 treesize of output 142 [2018-04-13 05:55:41,139 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-04-13 05:55:41,161 INFO L267 ElimStorePlain]: Start of recursive call 61: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:55:42,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, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 150 treesize of output 142 [2018-04-13 05:55:42,448 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 151 treesize of output 150 [2018-04-13 05:55:42,448 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-04-13 05:55:42,540 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:42,541 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:42,542 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:42,543 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:42,544 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:42,545 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:42,564 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 4 case distinctions, treesize of input 128 treesize of output 175 [2018-04-13 05:55:42,565 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 4 xjuncts. [2018-04-13 05:55:42,697 INFO L267 ElimStorePlain]: Start of recursive call 63: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-13 05:55:44,130 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 148 treesize of output 142 [2018-04-13 05:55:44,133 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:44,134 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:44,135 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:44,137 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:44,137 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:44,139 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:44,160 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 4 case distinctions, treesize of input 128 treesize of output 173 [2018-04-13 05:55:44,161 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 4 xjuncts. [2018-04-13 05:55:44,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 144 [2018-04-13 05:55:44,319 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2018-04-13 05:55:44,415 INFO L267 ElimStorePlain]: Start of recursive call 66: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-13 05:55:45,940 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 05:55:45,941 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 115 treesize of output 105 [2018-04-13 05:55:45,944 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:45,944 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:45,945 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:45,946 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:45,946 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:45,947 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:45,947 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 05:55:45,947 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:45,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 110 [2018-04-13 05:55:45,948 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2018-04-13 05:55:45,971 INFO L267 ElimStorePlain]: Start of recursive call 69: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:55:45,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 146 treesize of output 144 [2018-04-13 05:55:45,998 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:45,998 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:45,999 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:46,000 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:46,004 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:46,005 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:46,005 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:46,007 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:46,014 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 05:55:46,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 116 treesize of output 236 [2018-04-13 05:55:46,034 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 2 xjuncts. [2018-04-13 05:55:46,135 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:46,136 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 05:55:46,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 197 [2018-04-13 05:55:46,136 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2018-04-13 05:55:46,183 INFO L267 ElimStorePlain]: Start of recursive call 71: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 05:55:46,185 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 115 treesize of output 98 [2018-04-13 05:55:46,188 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:46,189 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:46,190 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:46,190 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:46,191 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:46,191 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:46,192 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:46,192 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:46,193 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:46,193 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:46,194 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:46,194 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 05:55:46,194 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:46,195 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:46,197 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 05:55:46,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 185 [2018-04-13 05:55:46,201 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2018-04-13 05:55:46,234 INFO L267 ElimStorePlain]: Start of recursive call 74: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:55:47,495 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 113 treesize of output 98 [2018-04-13 05:55:47,497 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:47,498 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:47,498 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:47,499 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:47,499 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:47,500 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:47,500 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:47,501 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:47,501 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:47,501 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 05:55:47,504 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:47,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 129 [2018-04-13 05:55:47,506 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2018-04-13 05:55:47,531 INFO L267 ElimStorePlain]: Start of recursive call 76: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:55:47,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, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 144 treesize of output 144 [2018-04-13 05:55:47,550 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:47,552 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 147 treesize of output 184 [2018-04-13 05:55:47,552 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2018-04-13 05:55:47,607 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:47,608 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:47,609 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:47,613 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:47,614 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:47,615 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:47,616 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:47,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 10 case distinctions, treesize of input 114 treesize of output 219 [2018-04-13 05:55:47,650 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 8 xjuncts. [2018-04-13 05:55:47,796 INFO L267 ElimStorePlain]: Start of recursive call 78: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-13 05:55:47,798 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 113 treesize of output 98 [2018-04-13 05:55:47,800 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:47,801 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:47,801 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:47,802 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:47,803 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:47,803 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:47,804 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:47,804 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:47,805 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:47,805 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:47,806 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:47,806 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 05:55:47,807 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:47,810 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:47,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 168 [2018-04-13 05:55:47,814 INFO L267 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2018-04-13 05:55:47,848 INFO L267 ElimStorePlain]: Start of recursive call 81: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:55:48,929 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 05:55:48,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 108 [2018-04-13 05:55:48,935 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:48,936 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:48,936 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:48,937 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:48,937 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:48,938 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 05:55:48,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 35 treesize of output 74 [2018-04-13 05:55:48,941 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2018-04-13 05:55:48,968 INFO L267 ElimStorePlain]: Start of recursive call 83: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:55:49,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 87 [2018-04-13 05:55:49,881 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:49,881 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:49,882 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:49,882 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:49,883 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:49,884 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:49,884 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:49,884 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:49,885 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:49,885 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 05:55:49,887 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:49,890 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 46 treesize of output 145 [2018-04-13 05:55:49,890 INFO L267 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2018-04-13 05:55:49,916 INFO L267 ElimStorePlain]: Start of recursive call 85: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:55:50,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 28 dim-2 vars, End of recursive call: 14 dim-0 vars, and 22 xjuncts. [2018-04-13 05:55:50,749 INFO L202 ElimStorePlain]: Needed 86 recursive calls to eliminate 44 variables, input treesize:1896, output treesize:3068 [2018-04-13 05:55:52,265 WARN L151 SmtUtils]: Spent 1430ms on a formula simplification. DAG size of input: 354 DAG size of output 320 [2018-04-13 05:55:52,294 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 05:55:52,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 208 treesize of output 156 [2018-04-13 05:55:52,307 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:52,308 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:52,308 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:52,309 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:52,309 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:52,310 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:55:52,315 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 216 [2018-04-13 05:55:52,316 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 05:55:52,347 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 05:58:38,687 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 05:58:38,694 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 180 treesize of output 160 [2018-04-13 05:58:38,697 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:58:38,698 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:58:38,699 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:58:38,699 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:58:38,700 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:58:38,700 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 05:58:38,704 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 35 treesize of output 94 [2018-04-13 05:58:38,704 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 05:58:38,740 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:01:05,795 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:01:05,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 166 treesize of output 141 [2018-04-13 06:01:05,797 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:01:05,798 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:01:05,798 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:01:05,799 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:01:05,800 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:01:05,800 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:01:05,804 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 123 treesize of output 179 [2018-04-13 06:01:05,804 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 06:01:05,828 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. Received shutdown request... [2018-04-13 06:01:07,415 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-04-13 06:01:07,415 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-13 06:01:07,418 WARN L197 ceAbstractionStarter]: Timeout [2018-04-13 06:01:07,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 06:01:07 BoogieIcfgContainer [2018-04-13 06:01:07,418 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-13 06:01:07,419 INFO L168 Benchmark]: Toolchain (without parser) took 866553.96 ms. Allocated memory was 390.6 MB in the beginning and 828.9 MB in the end (delta: 438.3 MB). Free memory was 328.5 MB in the beginning and 626.7 MB in the end (delta: -298.2 MB). Peak memory consumption was 418.0 MB. Max. memory is 5.3 GB. [2018-04-13 06:01:07,419 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 390.6 MB. Free memory is still 352.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-13 06:01:07,420 INFO L168 Benchmark]: CACSL2BoogieTranslator took 236.12 ms. Allocated memory is still 390.6 MB. Free memory was 327.9 MB in the beginning and 303.2 MB in the end (delta: 24.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 5.3 GB. [2018-04-13 06:01:07,420 INFO L168 Benchmark]: Boogie Preprocessor took 38.07 ms. Allocated memory is still 390.6 MB. Free memory was 303.2 MB in the beginning and 300.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 5.3 GB. [2018-04-13 06:01:07,420 INFO L168 Benchmark]: RCFGBuilder took 418.88 ms. Allocated memory was 390.6 MB in the beginning and 591.9 MB in the end (delta: 201.3 MB). Free memory was 300.0 MB in the beginning and 518.4 MB in the end (delta: -218.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 5.3 GB. [2018-04-13 06:01:07,420 INFO L168 Benchmark]: TraceAbstraction took 865858.00 ms. Allocated memory was 591.9 MB in the beginning and 828.9 MB in the end (delta: 237.0 MB). Free memory was 518.4 MB in the beginning and 626.7 MB in the end (delta: -108.3 MB). Peak memory consumption was 406.6 MB. Max. memory is 5.3 GB. [2018-04-13 06:01:07,421 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 390.6 MB. Free memory is still 352.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 236.12 ms. Allocated memory is still 390.6 MB. Free memory was 327.9 MB in the beginning and 303.2 MB in the end (delta: 24.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 38.07 ms. Allocated memory is still 390.6 MB. Free memory was 303.2 MB in the beginning and 300.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 5.3 GB. * RCFGBuilder took 418.88 ms. Allocated memory was 390.6 MB in the beginning and 591.9 MB in the end (delta: 201.3 MB). Free memory was 300.0 MB in the beginning and 518.4 MB in the end (delta: -218.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 865858.00 ms. Allocated memory was 591.9 MB in the beginning and 828.9 MB in the end (delta: 237.0 MB). Free memory was 518.4 MB in the beginning and 626.7 MB in the end (delta: -108.3 MB). Peak memory consumption was 406.6 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 analyzing trace of length 63 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 658. - TimeoutResultAtElement [Line: 647]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 63 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 658. - TimeoutResultAtElement [Line: 672]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 672). Cancelled while BasicCegarLoop was analyzing trace of length 63 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 658. - TimeoutResultAtElement [Line: 665]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 665). Cancelled while BasicCegarLoop was analyzing trace of length 63 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 658. - TimeoutResultAtElement [Line: 669]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 669). Cancelled while BasicCegarLoop was analyzing trace of length 63 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 658. - TimeoutResultAtElement [Line: 659]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 659). Cancelled while BasicCegarLoop was analyzing trace of length 63 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 658. - TimeoutResultAtElement [Line: 649]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was analyzing trace of length 63 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 658. - TimeoutResultAtElement [Line: 651]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 63 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 658. - TimeoutResultAtElement [Line: 637]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 63 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 658. - TimeoutResultAtElement [Line: 650]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was analyzing trace of length 63 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 658. - TimeoutResultAtElement [Line: 666]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was analyzing trace of length 63 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 658. - TimeoutResultAtElement [Line: 672]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 672). Cancelled while BasicCegarLoop was analyzing trace of length 63 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 658. - TimeoutResultAtElement [Line: 665]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 665). Cancelled while BasicCegarLoop was analyzing trace of length 63 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 658. - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 63 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 658. - TimeoutResultAtElement [Line: 670]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 670). Cancelled while BasicCegarLoop was analyzing trace of length 63 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 658. - TimeoutResultAtElement [Line: 648]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 63 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 658. - TimeoutResultAtElement [Line: 648]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 63 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 658. - TimeoutResultAtElement [Line: 658]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was analyzing trace of length 63 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 658. - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 63 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 658. - TimeoutResultAtElement [Line: 647]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 63 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 658. - TimeoutResultAtElement [Line: 640]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was analyzing trace of length 63 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 658. - TimeoutResultAtElement [Line: 649]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was analyzing trace of length 63 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 658. - TimeoutResultAtElement [Line: 651]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 63 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 658. - TimeoutResultAtElement [Line: 669]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 669). Cancelled while BasicCegarLoop was analyzing trace of length 63 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 658. - TimeoutResultAtElement [Line: 659]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 659). Cancelled while BasicCegarLoop was analyzing trace of length 63 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 658. - TimeoutResultAtElement [Line: 637]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 63 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 658. - TimeoutResultAtElement [Line: 648]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 63 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 658. - TimeoutResultAtElement [Line: 620]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 620). Cancelled while BasicCegarLoop was analyzing trace of length 63 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 658. - TimeoutResultAtElement [Line: 641]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 63 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 658. - TimeoutResultAtElement [Line: 670]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 670). Cancelled while BasicCegarLoop was analyzing trace of length 63 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 658. - TimeoutResultAtElement [Line: 666]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was analyzing trace of length 63 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 658. - TimeoutResultAtElement [Line: 640]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was analyzing trace of length 63 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 658. - TimeoutResultAtElement [Line: 650]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was analyzing trace of length 63 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 658. - TimeoutResultAtElement [Line: 647]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 63 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 658. - TimeoutResultAtElement [Line: 658]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was analyzing trace of length 63 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 658. - TimeoutResultAtElement [Line: 641]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 63 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 658. - TimeoutResultAtElement [Line: 647]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 63 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 658. - TimeoutResultAtElement [Line: 639]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 63 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 658. - TimeoutResultAtElement [Line: 648]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 63 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 658. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 98 locations, 39 error locations. TIMEOUT Result, 865.8s OverallTime, 39 OverallIterations, 3 TraceHistogramMax, 15.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2778 SDtfs, 7790 SDslu, 9924 SDs, 0 SdLazy, 9763 SolverSat, 641 SolverUnsat, 9 SolverUnknown, 0 SolverNotchecked, 7.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1350 GetRequests, 855 SyntacticMatches, 9 SemanticMatches, 486 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1595 ImplicationChecksByTransitivity, 8.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=302occurred in iteration=36, 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.1s AutomataMinimizationTime, 38 MinimizatonAttempts, 2030 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 11.7s InterpolantComputationTime, 2461 NumberOfCodeBlocks, 2461 NumberOfCodeBlocksAsserted, 60 NumberOfCheckSat, 1501 ConstructedInterpolants, 167 QuantifiedInterpolants, 1251988 SizeOfPredicates, 210 NumberOfNonLiveVariables, 4009 ConjunctsInSsa, 498 ConjunctsInUnsatCore, 39 InterpolantComputations, 21 PerfectInterpolantSequences, 148/321 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/test-0504_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-13_06-01-07-426.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-13_06-01-07-426.csv Completed graceful shutdown