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-ext/tree_of_cslls_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-408c70d-m [2018-04-13 06:22:59,748 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-13 06:22:59,750 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-13 06:22:59,762 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-13 06:22:59,762 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-13 06:22:59,763 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-13 06:22:59,763 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-13 06:22:59,765 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-13 06:22:59,766 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-13 06:22:59,767 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-13 06:22:59,768 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-13 06:22:59,768 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-13 06:22:59,769 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-13 06:22:59,769 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-13 06:22:59,770 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-13 06:22:59,772 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-13 06:22:59,773 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-13 06:22:59,774 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-13 06:22:59,775 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-13 06:22:59,776 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-13 06:22:59,777 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-13 06:22:59,778 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-13 06:22:59,778 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-13 06:22:59,779 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-13 06:22:59,779 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-13 06:22:59,780 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-13 06:22:59,780 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-13 06:22:59,781 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-13 06:22:59,781 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-13 06:22:59,781 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-13 06:22:59,782 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-13 06:22:59,782 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 06:22:59,791 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-13 06:22:59,791 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-13 06:22:59,792 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-13 06:22:59,792 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-13 06:22:59,792 INFO L133 SettingsManager]: * Use SBE=true [2018-04-13 06:22:59,793 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-13 06:22:59,793 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-13 06:22:59,793 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-13 06:22:59,793 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-13 06:22:59,793 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-13 06:22:59,793 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-13 06:22:59,793 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-13 06:22:59,793 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-13 06:22:59,793 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-13 06:22:59,793 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-13 06:22:59,794 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-13 06:22:59,794 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-13 06:22:59,794 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-13 06:22:59,794 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-13 06:22:59,794 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-13 06:22:59,794 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-13 06:22:59,794 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-13 06:22:59,794 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-13 06:22:59,794 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 06:22:59,820 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-13 06:22:59,828 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-13 06:22:59,830 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-13 06:22:59,831 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-13 06:22:59,831 INFO L276 PluginConnector]: CDTParser initialized [2018-04-13 06:22:59,832 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext/tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,188 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG7010a2a6e [2018-04-13 06:23:00,321 INFO L287 CDTParser]: IsIndexed: true [2018-04-13 06:23:00,322 INFO L288 CDTParser]: Found 1 translation units. [2018-04-13 06:23:00,322 INFO L168 CDTParser]: Scanning tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,329 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-13 06:23:00,329 INFO L215 ultiparseSymbolTable]: [2018-04-13 06:23:00,329 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-13 06:23:00,329 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,329 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-13 06:23:00,329 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____fsfilcnt64_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,330 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__ino_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,330 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__int32_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,330 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__pid_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,330 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__u_int64_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,330 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__TreeNode in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,330 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__gid_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,330 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__off_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,330 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__fsfilcnt_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,330 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____blkcnt64_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,330 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__ldiv_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,331 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____int8_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,331 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____ssize_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,331 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__timer_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,331 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____socklen_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,331 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__register_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,331 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____nlink_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,331 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__pthread_mutex_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,331 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__key_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,331 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____rlim_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,331 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____fsblkcnt64_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,331 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____swblk_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,331 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____int32_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,331 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____time_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,331 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__int8_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,331 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____suseconds_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,331 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__fsblkcnt_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,331 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____timer_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,332 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__u_int in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,332 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____rlim64_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,332 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____fsfilcnt_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,332 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__pthread_mutexattr_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,332 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____uint32_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,332 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__wchar_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,332 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__pthread_condattr_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,332 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__fd_set in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,332 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____clockid_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,332 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__pthread_attr_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,332 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____caddr_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,332 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__quad_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,333 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____dev_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,333 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__mode_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,333 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__lldiv_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,333 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__uid_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,333 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__int16_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,333 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__suseconds_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,333 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____sigset_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,333 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____u_short in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,333 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__size_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,333 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__u_int16_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,333 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__ulong in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,334 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__pthread_cond_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,334 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__pthread_once_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,334 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____intptr_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,334 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__div_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,334 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____u_long in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,334 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__blksize_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,334 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__pthread_spinlock_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,334 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__u_short in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,334 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__caddr_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,334 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____mode_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,334 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____ino_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,335 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__clock_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,335 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__daddr_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,335 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____fsid_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,335 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____int16_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,335 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__pthread_rwlockattr_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,335 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__u_long in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,335 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__u_char in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,335 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__pthread_barrier_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,335 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____off_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,335 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__blkcnt_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,335 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__ListNode in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,335 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____pthread_list_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,336 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__pthread_barrierattr_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,336 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____loff_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,336 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__int64_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,336 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____WAIT_STATUS in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,336 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__u_int32_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,336 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__fsid_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,336 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__ushort in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,336 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__u_quad_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,336 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____u_quad_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,336 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____clock_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,336 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____u_char in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,337 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____uint8_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,337 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____blksize_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,337 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____gid_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,337 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____off64_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,337 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____quad_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,337 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____pid_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,337 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____uint16_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,337 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____qaddr_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,337 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____daddr_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,337 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__loff_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,337 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__id_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,337 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__uint in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,337 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__u_int8_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,337 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__pthread_rwlock_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,337 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____u_int in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,337 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____useconds_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,337 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__dev_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,337 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__nlink_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,337 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____fd_mask in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,338 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____id_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,338 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____key_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,338 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____int64_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,338 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__pthread_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,338 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__time_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,338 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__clockid_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,338 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__pthread_key_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,338 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____fsblkcnt_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,338 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____sig_atomic_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,338 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__fd_mask in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,338 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____uint64_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,338 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____blkcnt_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,338 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____uid_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,338 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__ssize_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,338 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____ino64_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,338 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__sigset_t in tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:00,353 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG7010a2a6e [2018-04-13 06:23:00,357 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-13 06:23:00,358 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-13 06:23:00,358 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-13 06:23:00,358 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-13 06:23:00,363 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-13 06:23:00,364 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 06:23:00" (1/1) ... [2018-04-13 06:23:00,365 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14e05be3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:23:00, skipping insertion in model container [2018-04-13 06:23:00,365 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 06:23:00" (1/1) ... [2018-04-13 06:23:00,376 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-13 06:23:00,403 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-13 06:23:00,542 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-13 06:23:00,586 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-13 06:23:00,591 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 110 non ball SCCs. Number of states in SCCs 110. [2018-04-13 06:23:00,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:23:00 WrapperNode [2018-04-13 06:23:00,624 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-13 06:23:00,625 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-13 06:23:00,625 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-13 06:23:00,625 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-13 06:23:00,636 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:23:00" (1/1) ... [2018-04-13 06:23:00,637 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:23:00" (1/1) ... [2018-04-13 06:23:00,649 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:23:00" (1/1) ... [2018-04-13 06:23:00,650 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:23:00" (1/1) ... [2018-04-13 06:23:00,659 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:23:00" (1/1) ... [2018-04-13 06:23:00,663 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:23:00" (1/1) ... [2018-04-13 06:23:00,664 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:23:00" (1/1) ... [2018-04-13 06:23:00,667 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-13 06:23:00,667 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-13 06:23:00,667 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-13 06:23:00,667 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-13 06:23:00,668 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:23:00" (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 06:23:00,741 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-13 06:23:00,742 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-13 06:23:00,742 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-13 06:23:00,742 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-13 06:23:00,742 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-13 06:23:00,742 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-13 06:23:00,742 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-13 06:23:00,742 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-13 06:23:00,742 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-13 06:23:00,742 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-13 06:23:00,742 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-13 06:23:00,742 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-13 06:23:00,743 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-13 06:23:00,743 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-13 06:23:00,743 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-13 06:23:00,743 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-13 06:23:00,743 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-13 06:23:00,743 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-13 06:23:00,743 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-13 06:23:00,743 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-13 06:23:00,743 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-13 06:23:00,744 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-13 06:23:00,744 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-13 06:23:00,744 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-13 06:23:00,744 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-13 06:23:00,744 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-13 06:23:00,744 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-13 06:23:00,744 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-13 06:23:00,744 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-13 06:23:00,744 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-13 06:23:00,745 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-13 06:23:00,745 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-13 06:23:00,745 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-13 06:23:00,745 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-13 06:23:00,745 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-13 06:23:00,745 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-13 06:23:00,745 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-13 06:23:00,745 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-13 06:23:00,745 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-13 06:23:00,746 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-13 06:23:00,746 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-13 06:23:00,746 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-13 06:23:00,746 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-13 06:23:00,746 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-13 06:23:00,746 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-13 06:23:00,746 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-13 06:23:00,746 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-13 06:23:00,746 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-13 06:23:00,746 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-13 06:23:00,747 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-13 06:23:00,747 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-13 06:23:00,747 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-13 06:23:00,747 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-13 06:23:00,747 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-13 06:23:00,747 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-13 06:23:00,747 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-13 06:23:00,747 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-13 06:23:00,747 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-13 06:23:00,747 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-13 06:23:00,748 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-13 06:23:00,748 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-13 06:23:00,748 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-13 06:23:00,748 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-13 06:23:00,748 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-13 06:23:00,748 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-13 06:23:00,748 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-13 06:23:00,748 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-13 06:23:00,748 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-13 06:23:00,748 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-13 06:23:00,749 INFO L128 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-04-13 06:23:00,749 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-13 06:23:00,749 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-13 06:23:00,749 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-13 06:23:00,749 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-13 06:23:00,749 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-13 06:23:00,749 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-13 06:23:00,749 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-13 06:23:00,749 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-13 06:23:00,749 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-13 06:23:00,750 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-13 06:23:00,750 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-13 06:23:00,750 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-13 06:23:00,750 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-13 06:23:00,750 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-13 06:23:00,750 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-13 06:23:00,750 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-13 06:23:00,750 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-13 06:23:00,750 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-13 06:23:00,750 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-13 06:23:00,750 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-13 06:23:00,751 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-13 06:23:00,751 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-13 06:23:00,751 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-13 06:23:00,751 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-13 06:23:00,751 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-13 06:23:00,751 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-13 06:23:00,751 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-13 06:23:00,751 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-13 06:23:00,751 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-13 06:23:00,751 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-13 06:23:00,752 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-13 06:23:00,752 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-13 06:23:00,752 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-13 06:23:00,752 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-13 06:23:00,752 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-13 06:23:00,752 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-13 06:23:00,752 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-13 06:23:00,752 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-13 06:23:00,752 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-13 06:23:00,752 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-13 06:23:00,753 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-13 06:23:00,753 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-13 06:23:00,753 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-13 06:23:01,230 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-13 06:23:01,230 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 06:23:01 BoogieIcfgContainer [2018-04-13 06:23:01,231 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-13 06:23:01,231 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-13 06:23:01,231 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-13 06:23:01,233 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-13 06:23:01,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 06:23:00" (1/3) ... [2018-04-13 06:23:01,234 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32c4500b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 06:23:01, skipping insertion in model container [2018-04-13 06:23:01,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:23:00" (2/3) ... [2018-04-13 06:23:01,234 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32c4500b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 06:23:01, skipping insertion in model container [2018-04-13 06:23:01,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 06:23:01" (3/3) ... [2018-04-13 06:23:01,236 INFO L107 eAbstractionObserver]: Analyzing ICFG tree_of_cslls_true-valid-memsafety.i [2018-04-13 06:23:01,243 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-13 06:23:01,248 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 101 error locations. [2018-04-13 06:23:01,273 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-13 06:23:01,273 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-13 06:23:01,273 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-13 06:23:01,273 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-13 06:23:01,273 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-13 06:23:01,273 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-13 06:23:01,273 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-13 06:23:01,274 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-13 06:23:01,274 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-13 06:23:01,274 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-13 06:23:01,285 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states. [2018-04-13 06:23:01,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-13 06:23:01,292 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:23:01,293 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:23:01,293 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:23:01,296 INFO L82 PathProgramCache]: Analyzing trace with hash 268960233, now seen corresponding path program 1 times [2018-04-13 06:23:01,297 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:23:01,298 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:23:01,326 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:01,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:23:01,327 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:01,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:23:01,352 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:23:01,383 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 06:23:01,385 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:23:01,385 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 06:23:01,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 06:23:01,393 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 06:23:01,394 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 06:23:01,395 INFO L87 Difference]: Start difference. First operand 226 states. Second operand 4 states. [2018-04-13 06:23:01,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:23:01,741 INFO L93 Difference]: Finished difference Result 339 states and 363 transitions. [2018-04-13 06:23:01,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-13 06:23:01,742 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-13 06:23:01,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:23:01,751 INFO L225 Difference]: With dead ends: 339 [2018-04-13 06:23:01,751 INFO L226 Difference]: Without dead ends: 335 [2018-04-13 06:23:01,752 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 06:23:01,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-04-13 06:23:01,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 214. [2018-04-13 06:23:01,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-04-13 06:23:01,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 230 transitions. [2018-04-13 06:23:01,783 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 230 transitions. Word has length 8 [2018-04-13 06:23:01,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:23:01,783 INFO L459 AbstractCegarLoop]: Abstraction has 214 states and 230 transitions. [2018-04-13 06:23:01,783 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 06:23:01,783 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 230 transitions. [2018-04-13 06:23:01,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-13 06:23:01,784 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:23:01,784 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:23:01,784 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:23:01,784 INFO L82 PathProgramCache]: Analyzing trace with hash 268960234, now seen corresponding path program 1 times [2018-04-13 06:23:01,784 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:23:01,784 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:23:01,785 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:01,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:23:01,785 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:01,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:23:01,793 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:23:01,818 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 06:23:01,818 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:23:01,818 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 06:23:01,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 06:23:01,819 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 06:23:01,819 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 06:23:01,819 INFO L87 Difference]: Start difference. First operand 214 states and 230 transitions. Second operand 4 states. [2018-04-13 06:23:02,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:23:02,001 INFO L93 Difference]: Finished difference Result 212 states and 228 transitions. [2018-04-13 06:23:02,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-13 06:23:02,001 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-13 06:23:02,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:23:02,002 INFO L225 Difference]: With dead ends: 212 [2018-04-13 06:23:02,002 INFO L226 Difference]: Without dead ends: 212 [2018-04-13 06:23:02,003 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 06:23:02,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-04-13 06:23:02,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2018-04-13 06:23:02,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-04-13 06:23:02,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 228 transitions. [2018-04-13 06:23:02,010 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 228 transitions. Word has length 8 [2018-04-13 06:23:02,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:23:02,010 INFO L459 AbstractCegarLoop]: Abstraction has 212 states and 228 transitions. [2018-04-13 06:23:02,010 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 06:23:02,010 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 228 transitions. [2018-04-13 06:23:02,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-04-13 06:23:02,010 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:23:02,010 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:23:02,010 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:23:02,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1814695774, now seen corresponding path program 1 times [2018-04-13 06:23:02,011 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:23:02,011 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:23:02,011 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:02,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:23:02,011 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:02,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:23:02,025 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:23:02,029 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:23:02,029 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:23:02,029 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:23:02,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:23:02,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:23:02,060 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:23:02,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 06:23:02,101 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:02,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 06:23:02,110 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:02,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:02,136 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 06:23:02,265 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:02,266 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:02,268 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 06:23:02,269 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:02,290 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:02,291 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:02,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 06:23:02,292 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:02,298 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 06:23:02,298 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2018-04-13 06:23:02,309 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 06:23:02,310 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:23:02,310 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-13 06:23:02,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-13 06:23:02,310 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-13 06:23:02,310 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-13 06:23:02,311 INFO L87 Difference]: Start difference. First operand 212 states and 228 transitions. Second operand 6 states. [2018-04-13 06:23:02,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:23:02,853 INFO L93 Difference]: Finished difference Result 412 states and 441 transitions. [2018-04-13 06:23:02,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-13 06:23:02,854 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2018-04-13 06:23:02,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:23:02,856 INFO L225 Difference]: With dead ends: 412 [2018-04-13 06:23:02,856 INFO L226 Difference]: Without dead ends: 412 [2018-04-13 06:23:02,856 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-04-13 06:23:02,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2018-04-13 06:23:02,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 205. [2018-04-13 06:23:02,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-04-13 06:23:02,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 221 transitions. [2018-04-13 06:23:02,866 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 221 transitions. Word has length 11 [2018-04-13 06:23:02,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:23:02,866 INFO L459 AbstractCegarLoop]: Abstraction has 205 states and 221 transitions. [2018-04-13 06:23:02,866 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-13 06:23:02,867 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 221 transitions. [2018-04-13 06:23:02,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-13 06:23:02,867 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:23:02,867 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:23:02,871 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:23:02,871 INFO L82 PathProgramCache]: Analyzing trace with hash -848494062, now seen corresponding path program 1 times [2018-04-13 06:23:02,871 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:23:02,871 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:23:02,872 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:02,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:23:02,872 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:02,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:23:02,884 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:23:02,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 06:23:02,906 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:23:02,906 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 06:23:02,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 06:23:02,907 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 06:23:02,907 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-13 06:23:02,907 INFO L87 Difference]: Start difference. First operand 205 states and 221 transitions. Second operand 5 states. [2018-04-13 06:23:03,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:23:03,073 INFO L93 Difference]: Finished difference Result 284 states and 306 transitions. [2018-04-13 06:23:03,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 06:23:03,073 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-04-13 06:23:03,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:23:03,075 INFO L225 Difference]: With dead ends: 284 [2018-04-13 06:23:03,082 INFO L226 Difference]: Without dead ends: 284 [2018-04-13 06:23:03,083 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-13 06:23:03,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-04-13 06:23:03,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 204. [2018-04-13 06:23:03,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-04-13 06:23:03,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 220 transitions. [2018-04-13 06:23:03,089 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 220 transitions. Word has length 14 [2018-04-13 06:23:03,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:23:03,089 INFO L459 AbstractCegarLoop]: Abstraction has 204 states and 220 transitions. [2018-04-13 06:23:03,089 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 06:23:03,089 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 220 transitions. [2018-04-13 06:23:03,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-13 06:23:03,089 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:23:03,089 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:23:03,090 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:23:03,090 INFO L82 PathProgramCache]: Analyzing trace with hash -848494061, now seen corresponding path program 1 times [2018-04-13 06:23:03,090 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:23:03,090 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:23:03,091 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:03,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:23:03,091 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:03,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:23:03,101 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:23:03,133 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 06:23:03,134 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:23:03,134 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 06:23:03,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 06:23:03,134 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 06:23:03,134 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-13 06:23:03,134 INFO L87 Difference]: Start difference. First operand 204 states and 220 transitions. Second operand 5 states. [2018-04-13 06:23:03,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:23:03,327 INFO L93 Difference]: Finished difference Result 327 states and 357 transitions. [2018-04-13 06:23:03,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 06:23:03,327 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-04-13 06:23:03,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:23:03,328 INFO L225 Difference]: With dead ends: 327 [2018-04-13 06:23:03,328 INFO L226 Difference]: Without dead ends: 327 [2018-04-13 06:23:03,329 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-13 06:23:03,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-04-13 06:23:03,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 203. [2018-04-13 06:23:03,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-04-13 06:23:03,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 219 transitions. [2018-04-13 06:23:03,334 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 219 transitions. Word has length 14 [2018-04-13 06:23:03,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:23:03,334 INFO L459 AbstractCegarLoop]: Abstraction has 203 states and 219 transitions. [2018-04-13 06:23:03,334 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 06:23:03,334 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 219 transitions. [2018-04-13 06:23:03,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-13 06:23:03,335 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:23:03,335 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:23:03,335 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:23:03,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1899641121, now seen corresponding path program 1 times [2018-04-13 06:23:03,335 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:23:03,335 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:23:03,336 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:03,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:23:03,336 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:03,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:23:03,352 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:23:03,355 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:23:03,355 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:23:03,355 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:23:03,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:23:03,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:23:03,411 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:23:03,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 06:23:03,429 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:03,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:03,434 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2018-04-13 06:23:03,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 06:23:03,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 06:23:03,455 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:03,457 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:03,469 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 06:23:03,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 06:23:03,473 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:03,476 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:03,483 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 06:23:03,483 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:29 [2018-04-13 06:23:03,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-13 06:23:03,513 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 06:23:03,513 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:03,523 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:03,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:03,529 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:23 [2018-04-13 06:23:03,559 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 35 [2018-04-13 06:23:03,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-04-13 06:23:03,564 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:03,583 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:03,591 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 06:23:03,591 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:20 [2018-04-13 06:23:03,615 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:03,616 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:03,617 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:03,618 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 28 treesize of output 42 [2018-04-13 06:23:03,618 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:03,627 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 06:23:03,627 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:39 [2018-04-13 06:23:03,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-04-13 06:23:03,648 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 06:23:03,649 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:03,667 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:03,676 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 06:23:03,676 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:24 [2018-04-13 06:23:03,691 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 06:23:03,691 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:23:03,691 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-13 06:23:03,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-13 06:23:03,692 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-13 06:23:03,692 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-04-13 06:23:03,692 INFO L87 Difference]: Start difference. First operand 203 states and 219 transitions. Second operand 11 states. [2018-04-13 06:23:04,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:23:04,237 INFO L93 Difference]: Finished difference Result 380 states and 416 transitions. [2018-04-13 06:23:04,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-13 06:23:04,237 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-04-13 06:23:04,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:23:04,238 INFO L225 Difference]: With dead ends: 380 [2018-04-13 06:23:04,238 INFO L226 Difference]: Without dead ends: 380 [2018-04-13 06:23:04,239 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2018-04-13 06:23:04,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-04-13 06:23:04,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 210. [2018-04-13 06:23:04,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-04-13 06:23:04,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 228 transitions. [2018-04-13 06:23:04,251 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 228 transitions. Word has length 22 [2018-04-13 06:23:04,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:23:04,252 INFO L459 AbstractCegarLoop]: Abstraction has 210 states and 228 transitions. [2018-04-13 06:23:04,252 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-13 06:23:04,252 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 228 transitions. [2018-04-13 06:23:04,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-13 06:23:04,252 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:23:04,252 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] [2018-04-13 06:23:04,252 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:23:04,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1899641120, now seen corresponding path program 1 times [2018-04-13 06:23:04,253 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:23:04,253 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:23:04,253 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:04,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:23:04,253 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:04,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:23:04,265 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:23:04,268 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:23:04,268 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:23:04,268 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:23:04,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:23:04,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:23:04,313 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:23:04,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 06:23:04,320 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:04,321 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:04,321 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-13 06:23:04,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 06:23:04,329 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:04,337 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:04,338 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:04,339 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 06:23:04,339 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:04,346 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:04,346 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2018-04-13 06:23:04,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-13 06:23:04,365 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 06:23:04,365 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:04,367 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:04,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-13 06:23:04,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 06:23:04,378 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:04,379 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:04,384 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 06:23:04,385 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:46, output treesize:47 [2018-04-13 06:23:04,414 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 06:23:04,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 06:23:04,418 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:04,422 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:04,434 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 69 treesize of output 63 [2018-04-13 06:23:04,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 14 treesize of output 13 [2018-04-13 06:23:04,437 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:04,443 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:04,450 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:04,450 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:93, output treesize:47 [2018-04-13 06:23:04,454 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:04,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-13 06:23:04,455 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:04,464 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:04,464 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:04,465 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:04,466 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-04-13 06:23:04,466 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:04,471 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 06:23:04,472 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:50 [2018-04-13 06:23:04,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 33 [2018-04-13 06:23:04,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 14 [2018-04-13 06:23:04,497 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:04,501 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:04,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-13 06:23:04,510 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 06:23:04,510 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:04,511 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:04,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:23:04,520 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:68, output treesize:18 [2018-04-13 06:23:04,529 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 06:23:04,530 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:23:04,530 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-13 06:23:04,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-13 06:23:04,530 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-13 06:23:04,530 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-04-13 06:23:04,530 INFO L87 Difference]: Start difference. First operand 210 states and 228 transitions. Second operand 9 states. [2018-04-13 06:23:05,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:23:05,154 INFO L93 Difference]: Finished difference Result 420 states and 457 transitions. [2018-04-13 06:23:05,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-13 06:23:05,154 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-04-13 06:23:05,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:23:05,156 INFO L225 Difference]: With dead ends: 420 [2018-04-13 06:23:05,156 INFO L226 Difference]: Without dead ends: 420 [2018-04-13 06:23:05,156 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-04-13 06:23:05,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2018-04-13 06:23:05,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 210. [2018-04-13 06:23:05,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-04-13 06:23:05,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 227 transitions. [2018-04-13 06:23:05,159 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 227 transitions. Word has length 22 [2018-04-13 06:23:05,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:23:05,159 INFO L459 AbstractCegarLoop]: Abstraction has 210 states and 227 transitions. [2018-04-13 06:23:05,159 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-13 06:23:05,159 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 227 transitions. [2018-04-13 06:23:05,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-13 06:23:05,160 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:23:05,160 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] [2018-04-13 06:23:05,160 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:23:05,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1206347211, now seen corresponding path program 1 times [2018-04-13 06:23:05,160 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:23:05,160 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:23:05,161 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:05,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:23:05,161 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:05,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:23:05,167 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:23:05,194 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 06:23:05,194 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:23:05,194 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 06:23:05,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 06:23:05,195 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 06:23:05,208 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 06:23:05,208 INFO L87 Difference]: Start difference. First operand 210 states and 227 transitions. Second operand 4 states. [2018-04-13 06:23:05,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:23:05,340 INFO L93 Difference]: Finished difference Result 283 states and 307 transitions. [2018-04-13 06:23:05,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 06:23:05,340 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-04-13 06:23:05,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:23:05,341 INFO L225 Difference]: With dead ends: 283 [2018-04-13 06:23:05,341 INFO L226 Difference]: Without dead ends: 283 [2018-04-13 06:23:05,341 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 06:23:05,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-04-13 06:23:05,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 203. [2018-04-13 06:23:05,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-04-13 06:23:05,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 224 transitions. [2018-04-13 06:23:05,344 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 224 transitions. Word has length 23 [2018-04-13 06:23:05,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:23:05,344 INFO L459 AbstractCegarLoop]: Abstraction has 203 states and 224 transitions. [2018-04-13 06:23:05,344 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 06:23:05,344 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 224 transitions. [2018-04-13 06:23:05,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-13 06:23:05,344 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:23:05,344 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] [2018-04-13 06:23:05,344 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:23:05,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1206347212, now seen corresponding path program 1 times [2018-04-13 06:23:05,345 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:23:05,345 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:23:05,345 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:05,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:23:05,345 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:05,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:23:05,350 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:23:05,380 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 06:23:05,380 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:23:05,380 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-13 06:23:05,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-13 06:23:05,380 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-13 06:23:05,381 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-13 06:23:05,381 INFO L87 Difference]: Start difference. First operand 203 states and 224 transitions. Second operand 6 states. [2018-04-13 06:23:05,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:23:05,619 INFO L93 Difference]: Finished difference Result 488 states and 542 transitions. [2018-04-13 06:23:05,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-13 06:23:05,619 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-04-13 06:23:05,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:23:05,620 INFO L225 Difference]: With dead ends: 488 [2018-04-13 06:23:05,620 INFO L226 Difference]: Without dead ends: 488 [2018-04-13 06:23:05,621 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-04-13 06:23:05,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2018-04-13 06:23:05,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 366. [2018-04-13 06:23:05,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-04-13 06:23:05,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 491 transitions. [2018-04-13 06:23:05,628 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 491 transitions. Word has length 23 [2018-04-13 06:23:05,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:23:05,628 INFO L459 AbstractCegarLoop]: Abstraction has 366 states and 491 transitions. [2018-04-13 06:23:05,629 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-13 06:23:05,629 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 491 transitions. [2018-04-13 06:23:05,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-13 06:23:05,629 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:23:05,629 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] [2018-04-13 06:23:05,629 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:23:05,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1240667406, now seen corresponding path program 1 times [2018-04-13 06:23:05,630 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:23:05,630 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:23:05,630 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:05,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:23:05,631 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:05,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:23:05,638 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:23:05,655 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 06:23:05,655 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:23:05,656 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 06:23:05,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 06:23:05,656 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 06:23:05,656 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 06:23:05,656 INFO L87 Difference]: Start difference. First operand 366 states and 491 transitions. Second operand 4 states. [2018-04-13 06:23:05,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:23:05,895 INFO L93 Difference]: Finished difference Result 906 states and 1231 transitions. [2018-04-13 06:23:05,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 06:23:05,895 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-04-13 06:23:05,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:23:05,898 INFO L225 Difference]: With dead ends: 906 [2018-04-13 06:23:05,898 INFO L226 Difference]: Without dead ends: 906 [2018-04-13 06:23:05,899 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 06:23:05,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2018-04-13 06:23:05,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 364. [2018-04-13 06:23:05,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-04-13 06:23:05,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 486 transitions. [2018-04-13 06:23:05,908 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 486 transitions. Word has length 23 [2018-04-13 06:23:05,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:23:05,908 INFO L459 AbstractCegarLoop]: Abstraction has 364 states and 486 transitions. [2018-04-13 06:23:05,909 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 06:23:05,909 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 486 transitions. [2018-04-13 06:23:05,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-13 06:23:05,909 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:23:05,909 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] [2018-04-13 06:23:05,909 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:23:05,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1240667407, now seen corresponding path program 1 times [2018-04-13 06:23:05,910 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:23:05,910 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:23:05,910 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:05,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:23:05,911 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:05,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:23:05,918 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:23:05,947 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 06:23:05,947 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:23:05,947 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 06:23:05,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 06:23:05,947 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 06:23:05,947 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 06:23:05,948 INFO L87 Difference]: Start difference. First operand 364 states and 486 transitions. Second operand 4 states. [2018-04-13 06:23:06,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:23:06,187 INFO L93 Difference]: Finished difference Result 750 states and 1035 transitions. [2018-04-13 06:23:06,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-13 06:23:06,187 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-04-13 06:23:06,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:23:06,189 INFO L225 Difference]: With dead ends: 750 [2018-04-13 06:23:06,189 INFO L226 Difference]: Without dead ends: 750 [2018-04-13 06:23:06,189 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 06:23:06,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2018-04-13 06:23:06,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 363. [2018-04-13 06:23:06,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-04-13 06:23:06,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 485 transitions. [2018-04-13 06:23:06,197 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 485 transitions. Word has length 23 [2018-04-13 06:23:06,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:23:06,197 INFO L459 AbstractCegarLoop]: Abstraction has 363 states and 485 transitions. [2018-04-13 06:23:06,197 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 06:23:06,197 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 485 transitions. [2018-04-13 06:23:06,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-13 06:23:06,198 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:23:06,198 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 06:23:06,198 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:23:06,199 INFO L82 PathProgramCache]: Analyzing trace with hash -339091572, now seen corresponding path program 1 times [2018-04-13 06:23:06,199 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:23:06,199 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:23:06,200 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:06,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:23:06,200 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:06,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:23:06,207 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:23:06,223 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 06:23:06,224 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:23:06,224 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 06:23:06,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 06:23:06,224 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 06:23:06,224 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 06:23:06,225 INFO L87 Difference]: Start difference. First operand 363 states and 485 transitions. Second operand 4 states. [2018-04-13 06:23:06,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:23:06,247 INFO L93 Difference]: Finished difference Result 439 states and 565 transitions. [2018-04-13 06:23:06,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-13 06:23:06,247 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-04-13 06:23:06,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:23:06,249 INFO L225 Difference]: With dead ends: 439 [2018-04-13 06:23:06,249 INFO L226 Difference]: Without dead ends: 439 [2018-04-13 06:23:06,249 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 06:23:06,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2018-04-13 06:23:06,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 408. [2018-04-13 06:23:06,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2018-04-13 06:23:06,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 565 transitions. [2018-04-13 06:23:06,258 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 565 transitions. Word has length 25 [2018-04-13 06:23:06,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:23:06,259 INFO L459 AbstractCegarLoop]: Abstraction has 408 states and 565 transitions. [2018-04-13 06:23:06,259 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 06:23:06,259 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 565 transitions. [2018-04-13 06:23:06,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-13 06:23:06,260 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:23:06,260 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 06:23:06,260 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:23:06,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1765841307, now seen corresponding path program 1 times [2018-04-13 06:23:06,260 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:23:06,260 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:23:06,261 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:06,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:23:06,261 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:06,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:23:06,273 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:23:06,275 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:23:06,275 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:23:06,275 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:23:06,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:23:06,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:23:06,332 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:23:06,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 06:23:06,340 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:06,348 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 06:23:06,348 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:06,353 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:06,353 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:19 [2018-04-13 06:23:06,364 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 06:23:06,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 06:23:06,367 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:06,369 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:06,377 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 06:23:06,377 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:38 [2018-04-13 06:23:06,406 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:06,409 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 46 treesize of output 50 [2018-04-13 06:23:06,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-13 06:23:06,412 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:06,418 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:06,427 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 06:23:06,428 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:38 [2018-04-13 06:23:06,436 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:06,437 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:06,438 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:06,439 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:06,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 55 [2018-04-13 06:23:06,441 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:06,455 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:06,456 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:06,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-04-13 06:23:06,457 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:06,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:06,464 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:49 [2018-04-13 06:23:06,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 44 [2018-04-13 06:23:06,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 06:23:06,508 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:06,518 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:06,526 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:23:06,526 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:60, output treesize:49 [2018-04-13 06:23:06,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 33 [2018-04-13 06:23:06,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 14 [2018-04-13 06:23:06,548 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:06,551 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:06,557 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 06:23:06,558 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:58, output treesize:28 [2018-04-13 06:23:06,567 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 06:23:06,567 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:23:06,567 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-13 06:23:06,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-13 06:23:06,567 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-13 06:23:06,567 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-04-13 06:23:06,567 INFO L87 Difference]: Start difference. First operand 408 states and 565 transitions. Second operand 10 states. [2018-04-13 06:23:07,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:23:07,520 INFO L93 Difference]: Finished difference Result 771 states and 1053 transitions. [2018-04-13 06:23:07,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-13 06:23:07,520 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2018-04-13 06:23:07,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:23:07,522 INFO L225 Difference]: With dead ends: 771 [2018-04-13 06:23:07,522 INFO L226 Difference]: Without dead ends: 771 [2018-04-13 06:23:07,522 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2018-04-13 06:23:07,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2018-04-13 06:23:07,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 407. [2018-04-13 06:23:07,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2018-04-13 06:23:07,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 564 transitions. [2018-04-13 06:23:07,527 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 564 transitions. Word has length 26 [2018-04-13 06:23:07,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:23:07,527 INFO L459 AbstractCegarLoop]: Abstraction has 407 states and 564 transitions. [2018-04-13 06:23:07,527 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-13 06:23:07,527 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 564 transitions. [2018-04-13 06:23:07,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-13 06:23:07,527 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:23:07,527 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 06:23:07,528 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:23:07,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1765841306, now seen corresponding path program 1 times [2018-04-13 06:23:07,528 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:23:07,528 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:23:07,529 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:07,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:23:07,529 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:07,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:23:07,534 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:23:07,537 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:23:07,537 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:23:07,537 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:23:07,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:23:07,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:23:07,564 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:23:07,571 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 06:23:07,571 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:07,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:07,572 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2018-04-13 06:23:07,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-13 06:23:07,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 06:23:07,582 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:07,583 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:07,599 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 06:23:07,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 06:23:07,600 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:07,602 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:07,606 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 06:23:07,606 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:35, output treesize:18 [2018-04-13 06:23:07,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-13 06:23:07,615 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 06:23:07,615 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:07,617 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:07,621 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:07,621 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:12 [2018-04-13 06:23:07,632 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 06:23:07,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 06:23:07,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:07,636 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:07,642 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 06:23:07,643 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:23, output treesize:9 [2018-04-13 06:23:07,652 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:07,653 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:07,653 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 06:23:07,654 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:07,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:07,657 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-04-13 06:23:07,713 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 40 treesize of output 41 [2018-04-13 06:23:07,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 06:23:07,716 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:07,721 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:07,732 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 31 treesize of output 32 [2018-04-13 06:23:07,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 06:23:07,734 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:07,737 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:07,744 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:07,744 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:58, output treesize:32 [2018-04-13 06:23:07,757 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 29 treesize of output 25 [2018-04-13 06:23:07,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2018-04-13 06:23:07,759 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:07,760 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:07,765 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 32 treesize of output 26 [2018-04-13 06:23:07,766 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 26 treesize of output 11 [2018-04-13 06:23:07,767 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:07,769 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:07,772 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 06:23:07,772 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:50, output treesize:11 [2018-04-13 06:23:07,779 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 06:23:07,779 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:23:07,779 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-04-13 06:23:07,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-13 06:23:07,780 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-13 06:23:07,780 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-04-13 06:23:07,780 INFO L87 Difference]: Start difference. First operand 407 states and 564 transitions. Second operand 13 states. [2018-04-13 06:23:08,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:23:08,699 INFO L93 Difference]: Finished difference Result 1493 states and 2063 transitions. [2018-04-13 06:23:08,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-13 06:23:08,699 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2018-04-13 06:23:08,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:23:08,702 INFO L225 Difference]: With dead ends: 1493 [2018-04-13 06:23:08,702 INFO L226 Difference]: Without dead ends: 1493 [2018-04-13 06:23:08,703 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=306, Invalid=750, Unknown=0, NotChecked=0, Total=1056 [2018-04-13 06:23:08,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1493 states. [2018-04-13 06:23:08,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1493 to 406. [2018-04-13 06:23:08,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2018-04-13 06:23:08,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 563 transitions. [2018-04-13 06:23:08,710 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 563 transitions. Word has length 26 [2018-04-13 06:23:08,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:23:08,710 INFO L459 AbstractCegarLoop]: Abstraction has 406 states and 563 transitions. [2018-04-13 06:23:08,710 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-13 06:23:08,710 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 563 transitions. [2018-04-13 06:23:08,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-13 06:23:08,711 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:23:08,711 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:23:08,711 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:23:08,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1476109501, now seen corresponding path program 1 times [2018-04-13 06:23:08,711 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:23:08,711 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:23:08,712 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:08,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:23:08,712 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:08,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:23:08,718 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:23:08,725 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 06:23:08,725 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:23:08,725 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 06:23:08,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-13 06:23:08,725 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-13 06:23:08,725 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-13 06:23:08,726 INFO L87 Difference]: Start difference. First operand 406 states and 563 transitions. Second operand 3 states. [2018-04-13 06:23:08,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:23:08,730 INFO L93 Difference]: Finished difference Result 410 states and 567 transitions. [2018-04-13 06:23:08,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-13 06:23:08,730 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-04-13 06:23:08,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:23:08,731 INFO L225 Difference]: With dead ends: 410 [2018-04-13 06:23:08,731 INFO L226 Difference]: Without dead ends: 410 [2018-04-13 06:23:08,731 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 06:23:08,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2018-04-13 06:23:08,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 410. [2018-04-13 06:23:08,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-04-13 06:23:08,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 567 transitions. [2018-04-13 06:23:08,736 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 567 transitions. Word has length 30 [2018-04-13 06:23:08,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:23:08,736 INFO L459 AbstractCegarLoop]: Abstraction has 410 states and 567 transitions. [2018-04-13 06:23:08,736 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-13 06:23:08,736 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 567 transitions. [2018-04-13 06:23:08,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-13 06:23:08,736 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:23:08,736 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:23:08,736 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:23:08,736 INFO L82 PathProgramCache]: Analyzing trace with hash -664022590, now seen corresponding path program 1 times [2018-04-13 06:23:08,737 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:23:08,737 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:23:08,737 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:08,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:23:08,737 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:08,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:23:08,742 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:23:08,751 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 06:23:08,751 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:23:08,751 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 06:23:08,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-13 06:23:08,751 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-13 06:23:08,752 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-13 06:23:08,752 INFO L87 Difference]: Start difference. First operand 410 states and 567 transitions. Second operand 3 states. [2018-04-13 06:23:08,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:23:08,756 INFO L93 Difference]: Finished difference Result 413 states and 570 transitions. [2018-04-13 06:23:08,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-13 06:23:08,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-04-13 06:23:08,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:23:08,757 INFO L225 Difference]: With dead ends: 413 [2018-04-13 06:23:08,757 INFO L226 Difference]: Without dead ends: 413 [2018-04-13 06:23:08,757 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 06:23:08,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2018-04-13 06:23:08,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2018-04-13 06:23:08,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2018-04-13 06:23:08,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 570 transitions. [2018-04-13 06:23:08,761 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 570 transitions. Word has length 31 [2018-04-13 06:23:08,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:23:08,761 INFO L459 AbstractCegarLoop]: Abstraction has 413 states and 570 transitions. [2018-04-13 06:23:08,761 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-13 06:23:08,762 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 570 transitions. [2018-04-13 06:23:08,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-13 06:23:08,762 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:23:08,762 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:23:08,762 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:23:08,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1251934904, now seen corresponding path program 1 times [2018-04-13 06:23:08,763 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:23:08,763 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:23:08,763 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:08,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:23:08,764 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:08,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:23:08,768 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:23:08,779 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 06:23:08,780 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:23:08,780 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 06:23:08,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-13 06:23:08,780 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-13 06:23:08,780 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-13 06:23:08,780 INFO L87 Difference]: Start difference. First operand 413 states and 570 transitions. Second operand 3 states. [2018-04-13 06:23:08,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:23:08,790 INFO L93 Difference]: Finished difference Result 456 states and 601 transitions. [2018-04-13 06:23:08,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-13 06:23:08,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-04-13 06:23:08,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:23:08,791 INFO L225 Difference]: With dead ends: 456 [2018-04-13 06:23:08,791 INFO L226 Difference]: Without dead ends: 456 [2018-04-13 06:23:08,791 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 06:23:08,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2018-04-13 06:23:08,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 401. [2018-04-13 06:23:08,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2018-04-13 06:23:08,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 547 transitions. [2018-04-13 06:23:08,795 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 547 transitions. Word has length 32 [2018-04-13 06:23:08,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:23:08,795 INFO L459 AbstractCegarLoop]: Abstraction has 401 states and 547 transitions. [2018-04-13 06:23:08,795 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-13 06:23:08,795 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 547 transitions. [2018-04-13 06:23:08,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-13 06:23:08,795 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:23:08,795 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:23:08,796 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:23:08,796 INFO L82 PathProgramCache]: Analyzing trace with hash -403555681, now seen corresponding path program 1 times [2018-04-13 06:23:08,796 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:23:08,796 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:23:08,796 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:08,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:23:08,797 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:08,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:23:08,824 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:23:08,827 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:23:08,827 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:23:08,827 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:23:08,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:23:08,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:23:08,850 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:23:08,874 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 06:23:08,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 06:23:08,877 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:08,879 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:08,886 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 06:23:08,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 06:23:08,888 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:08,890 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:08,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:08,895 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2018-04-13 06:23:08,914 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 06:23:08,916 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:08,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-13 06:23:08,918 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:08,921 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:08,929 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 06:23:08,932 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:08,933 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 06:23:08,933 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:08,937 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:08,944 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 06:23:08,944 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:48, output treesize:31 [2018-04-13 06:23:08,990 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 21 treesize of output 33 [2018-04-13 06:23:08,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-04-13 06:23:08,994 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:09,009 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:09,038 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 39 treesize of output 47 [2018-04-13 06:23:09,043 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:09,044 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:09,044 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:09,047 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 33 treesize of output 58 [2018-04-13 06:23:09,047 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:09,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2018-04-13 06:23:09,073 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:09,082 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:09,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:09,091 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:65, output treesize:40 [2018-04-13 06:23:09,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-13 06:23:09,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-13 06:23:09,116 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:09,117 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:09,121 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 06:23:09,122 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 16 treesize of output 3 [2018-04-13 06:23:09,122 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:09,123 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:09,125 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 06:23:09,125 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:36, output treesize:7 [2018-04-13 06:23:09,139 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 06:23:09,139 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:23:09,139 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-04-13 06:23:09,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-13 06:23:09,140 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-13 06:23:09,140 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-04-13 06:23:09,140 INFO L87 Difference]: Start difference. First operand 401 states and 547 transitions. Second operand 11 states. [2018-04-13 06:23:09,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:23:09,647 INFO L93 Difference]: Finished difference Result 566 states and 729 transitions. [2018-04-13 06:23:09,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-13 06:23:09,647 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 33 [2018-04-13 06:23:09,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:23:09,649 INFO L225 Difference]: With dead ends: 566 [2018-04-13 06:23:09,649 INFO L226 Difference]: Without dead ends: 566 [2018-04-13 06:23:09,649 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=320, Unknown=0, NotChecked=0, Total=462 [2018-04-13 06:23:09,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2018-04-13 06:23:09,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 420. [2018-04-13 06:23:09,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2018-04-13 06:23:09,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 572 transitions. [2018-04-13 06:23:09,656 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 572 transitions. Word has length 33 [2018-04-13 06:23:09,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:23:09,656 INFO L459 AbstractCegarLoop]: Abstraction has 420 states and 572 transitions. [2018-04-13 06:23:09,656 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-13 06:23:09,656 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 572 transitions. [2018-04-13 06:23:09,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-13 06:23:09,657 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:23:09,657 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:23:09,657 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:23:09,657 INFO L82 PathProgramCache]: Analyzing trace with hash 932853160, now seen corresponding path program 1 times [2018-04-13 06:23:09,657 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:23:09,657 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:23:09,658 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:09,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:23:09,658 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:09,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:23:09,665 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:23:09,668 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:23:09,668 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:23:09,668 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:23:09,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:23:09,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:23:09,691 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:23:09,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 06:23:09,696 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:09,699 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:09,699 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 06:23:09,712 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 06:23:09,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 06:23:09,714 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:09,715 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:09,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-13 06:23:09,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 06:23:09,727 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:09,729 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:09,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:09,737 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-04-13 06:23:09,756 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 06:23:09,759 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:09,760 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 06:23:09,760 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:09,765 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:09,780 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 06:23:09,784 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:09,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 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-13 06:23:09,785 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:09,790 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:09,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:09,800 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:52, output treesize:44 [2018-04-13 06:23:09,819 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:09,820 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:09,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 06:23:09,821 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:09,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:09,831 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:43 [2018-04-13 06:23:09,856 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 30 treesize of output 23 [2018-04-13 06:23:09,859 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:09,859 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:09,860 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:09,862 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 23 treesize of output 46 [2018-04-13 06:23:09,863 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:09,874 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:09,895 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 30 treesize of output 23 [2018-04-13 06:23:09,901 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:09,901 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:09,902 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:09,904 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 06:23:09,905 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:09,913 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:09,926 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 06:23:09,926 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:69, output treesize:49 [2018-04-13 06:23:09,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 67 [2018-04-13 06:23:09,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-13 06:23:09,975 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:09,987 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:10,005 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 40 treesize of output 41 [2018-04-13 06:23:10,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 06:23:10,008 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:10,014 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:10,027 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:10,028 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:95, output treesize:49 [2018-04-13 06:23:10,076 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 34 treesize of output 26 [2018-04-13 06:23:10,078 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:10,079 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:23:10,080 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:10,080 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:10,083 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 26 treesize of output 31 [2018-04-13 06:23:10,084 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:10,090 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:10,102 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 24 treesize of output 18 [2018-04-13 06:23:10,104 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:23:10,104 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:10,105 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 18 treesize of output 13 [2018-04-13 06:23:10,105 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:10,108 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:10,115 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:10,115 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:69, output treesize:7 [2018-04-13 06:23:10,138 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 06:23:10,139 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:23:10,139 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-04-13 06:23:10,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-13 06:23:10,140 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-13 06:23:10,140 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-04-13 06:23:10,140 INFO L87 Difference]: Start difference. First operand 420 states and 572 transitions. Second operand 12 states. [2018-04-13 06:23:11,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:23:11,139 INFO L93 Difference]: Finished difference Result 809 states and 1040 transitions. [2018-04-13 06:23:11,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-13 06:23:11,140 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 34 [2018-04-13 06:23:11,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:23:11,141 INFO L225 Difference]: With dead ends: 809 [2018-04-13 06:23:11,141 INFO L226 Difference]: Without dead ends: 809 [2018-04-13 06:23:11,141 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=301, Unknown=0, NotChecked=0, Total=420 [2018-04-13 06:23:11,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2018-04-13 06:23:11,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 432. [2018-04-13 06:23:11,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2018-04-13 06:23:11,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 586 transitions. [2018-04-13 06:23:11,146 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 586 transitions. Word has length 34 [2018-04-13 06:23:11,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:23:11,147 INFO L459 AbstractCegarLoop]: Abstraction has 432 states and 586 transitions. [2018-04-13 06:23:11,147 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-13 06:23:11,147 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 586 transitions. [2018-04-13 06:23:11,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-13 06:23:11,147 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:23:11,147 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:23:11,147 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:23:11,147 INFO L82 PathProgramCache]: Analyzing trace with hash 938578798, now seen corresponding path program 1 times [2018-04-13 06:23:11,147 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:23:11,147 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:23:11,148 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:11,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:23:11,148 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:11,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:23:11,152 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:23:11,245 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 06:23:11,245 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:23:11,245 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-13 06:23:11,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-13 06:23:11,245 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-13 06:23:11,245 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-13 06:23:11,245 INFO L87 Difference]: Start difference. First operand 432 states and 586 transitions. Second operand 6 states. [2018-04-13 06:23:11,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:23:11,366 INFO L93 Difference]: Finished difference Result 451 states and 608 transitions. [2018-04-13 06:23:11,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-13 06:23:11,402 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-04-13 06:23:11,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:23:11,404 INFO L225 Difference]: With dead ends: 451 [2018-04-13 06:23:11,404 INFO L226 Difference]: Without dead ends: 448 [2018-04-13 06:23:11,404 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-04-13 06:23:11,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2018-04-13 06:23:11,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 439. [2018-04-13 06:23:11,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2018-04-13 06:23:11,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 595 transitions. [2018-04-13 06:23:11,408 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 595 transitions. Word has length 34 [2018-04-13 06:23:11,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:23:11,408 INFO L459 AbstractCegarLoop]: Abstraction has 439 states and 595 transitions. [2018-04-13 06:23:11,408 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-13 06:23:11,408 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 595 transitions. [2018-04-13 06:23:11,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-13 06:23:11,409 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:23:11,409 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] [2018-04-13 06:23:11,409 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:23:11,409 INFO L82 PathProgramCache]: Analyzing trace with hash -536384940, now seen corresponding path program 1 times [2018-04-13 06:23:11,409 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:23:11,409 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:23:11,410 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:11,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:23:11,410 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:11,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:23:11,415 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:23:11,417 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:23:11,417 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:23:11,417 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:23:11,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:23:11,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:23:11,456 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:23:11,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 06:23:11,458 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:11,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:11,461 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 06:23:11,470 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 06:23:11,470 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:11,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 06:23:11,476 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:11,489 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:11,489 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2018-04-13 06:23:11,500 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 06:23:11,501 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 06:23:11,501 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:11,503 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:11,512 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 06:23:11,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 06:23:11,513 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:11,516 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:11,523 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 06:23:11,523 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2018-04-13 06:23:11,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-13 06:23:11,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-04-13 06:23:11,548 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:11,550 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:11,557 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:11,557 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:34 [2018-04-13 06:23:11,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 44 [2018-04-13 06:23:11,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 35 treesize of output 34 [2018-04-13 06:23:11,591 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:11,615 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:11,632 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 06:23:11,632 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:31 [2018-04-13 06:23:11,647 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:11,649 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:11,649 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:11,650 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 28 treesize of output 42 [2018-04-13 06:23:11,651 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:11,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-13 06:23:11,672 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:11,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:11,683 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:55 [2018-04-13 06:23:11,739 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 44 treesize of output 45 [2018-04-13 06:23:11,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 06:23:11,742 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:11,749 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:11,757 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 06:23:11,757 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:66, output treesize:55 [2018-04-13 06:23:11,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2018-04-13 06:23:11,785 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:11,808 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 50 [2018-04-13 06:23:11,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2018-04-13 06:23:11,821 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:11,842 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:11,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:23:11,852 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:91, output treesize:72 [2018-04-13 06:23:11,879 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:11,880 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:11,880 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:11,881 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:11,882 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 43 treesize of output 105 [2018-04-13 06:23:11,882 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:11,906 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 06:23:11,906 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:83, output treesize:105 [2018-04-13 06:23:11,946 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 1 case distinctions, treesize of input 94 treesize of output 62 [2018-04-13 06:23:11,953 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 58 treesize of output 39 [2018-04-13 06:23:11,953 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:11,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2018-04-13 06:23:11,972 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 06:23:11,988 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 33 [2018-04-13 06:23:11,989 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:23:12,003 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 06:23:12,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-04-13 06:23:12,045 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:114, output treesize:87 [2018-04-13 06:23:12,075 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 06:23:12,075 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 06:23:12,075 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-04-13 06:23:12,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-13 06:23:12,076 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-13 06:23:12,076 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-04-13 06:23:12,076 INFO L87 Difference]: Start difference. First operand 439 states and 595 transitions. Second operand 14 states. [2018-04-13 06:23:14,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:23:14,723 INFO L93 Difference]: Finished difference Result 891 states and 1163 transitions. [2018-04-13 06:23:14,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-13 06:23:14,723 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2018-04-13 06:23:14,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:23:14,724 INFO L225 Difference]: With dead ends: 891 [2018-04-13 06:23:14,724 INFO L226 Difference]: Without dead ends: 891 [2018-04-13 06:23:14,725 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=216, Invalid=486, Unknown=0, NotChecked=0, Total=702 [2018-04-13 06:23:14,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2018-04-13 06:23:14,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 438. [2018-04-13 06:23:14,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2018-04-13 06:23:14,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 594 transitions. [2018-04-13 06:23:14,729 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 594 transitions. Word has length 34 [2018-04-13 06:23:14,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:23:14,729 INFO L459 AbstractCegarLoop]: Abstraction has 438 states and 594 transitions. [2018-04-13 06:23:14,729 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-13 06:23:14,729 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 594 transitions. [2018-04-13 06:23:14,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-13 06:23:14,729 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:23:14,729 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] [2018-04-13 06:23:14,729 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:23:14,730 INFO L82 PathProgramCache]: Analyzing trace with hash -536384939, now seen corresponding path program 1 times [2018-04-13 06:23:14,730 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:23:14,730 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:23:14,730 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:14,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:23:14,730 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:14,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:23:14,739 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:23:14,742 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:23:14,742 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:23:14,742 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:23:14,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:23:14,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:23:14,798 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:23:14,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 06:23:14,803 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:14,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:14,805 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 06:23:14,819 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:14,819 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:14,820 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 06:23:14,820 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:14,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 06:23:14,829 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:14,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:14,835 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:26 [2018-04-13 06:23:14,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-13 06:23:14,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, 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 06:23:14,847 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:14,848 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:14,853 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 06:23:14,853 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:41 [2018-04-13 06:23:14,873 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 56 treesize of output 50 [2018-04-13 06:23:14,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 06:23:14,886 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:14,890 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:14,894 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 06:23:14,894 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:64, output treesize:41 [2018-04-13 06:23:14,897 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:14,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-13 06:23:14,897 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:14,906 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:14,907 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:14,907 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:14,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 52 [2018-04-13 06:23:14,908 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:14,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:14,916 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:65 [2018-04-13 06:23:14,967 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:14,973 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 44 treesize of output 45 [2018-04-13 06:23:14,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 06:23:14,975 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:14,980 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:14,989 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 06:23:14,989 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:58 [2018-04-13 06:23:15,017 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:15,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 88 [2018-04-13 06:23:15,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-13 06:23:15,021 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:15,027 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:15,043 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:15,045 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 100 treesize of output 104 [2018-04-13 06:23:15,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-13 06:23:15,047 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:15,055 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:15,069 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 06:23:15,069 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:144, output treesize:134 [2018-04-13 06:23:15,095 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:15,096 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:15,096 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:15,097 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:15,097 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:15,098 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:15,098 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 43 treesize of output 91 [2018-04-13 06:23:15,099 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:15,115 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:15,115 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:15,116 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:15,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 178 [2018-04-13 06:23:15,117 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:15,133 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 06:23:15,133 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:145, output treesize:132 [2018-04-13 06:23:15,157 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:15,158 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 71 [2018-04-13 06:23:15,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 35 [2018-04-13 06:23:15,159 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:15,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2018-04-13 06:23:15,167 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 06:23:15,199 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 06:23:15,209 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 26 treesize of output 20 [2018-04-13 06:23:15,210 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 20 treesize of output 11 [2018-04-13 06:23:15,210 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:15,212 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:15,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-13 06:23:15,220 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:117, output treesize:43 [2018-04-13 06:23:15,241 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 06:23:15,241 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 06:23:15,241 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-04-13 06:23:15,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-13 06:23:15,241 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-13 06:23:15,241 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-04-13 06:23:15,241 INFO L87 Difference]: Start difference. First operand 438 states and 594 transitions. Second operand 14 states. [2018-04-13 06:23:16,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:23:16,647 INFO L93 Difference]: Finished difference Result 890 states and 1162 transitions. [2018-04-13 06:23:16,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-13 06:23:16,648 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2018-04-13 06:23:16,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:23:16,650 INFO L225 Difference]: With dead ends: 890 [2018-04-13 06:23:16,650 INFO L226 Difference]: Without dead ends: 890 [2018-04-13 06:23:16,650 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=217, Invalid=485, Unknown=0, NotChecked=0, Total=702 [2018-04-13 06:23:16,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2018-04-13 06:23:16,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 433. [2018-04-13 06:23:16,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2018-04-13 06:23:16,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 589 transitions. [2018-04-13 06:23:16,654 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 589 transitions. Word has length 34 [2018-04-13 06:23:16,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:23:16,655 INFO L459 AbstractCegarLoop]: Abstraction has 433 states and 589 transitions. [2018-04-13 06:23:16,655 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-13 06:23:16,655 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 589 transitions. [2018-04-13 06:23:16,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-13 06:23:16,655 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:23:16,655 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:23:16,655 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:23:16,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1086725402, now seen corresponding path program 1 times [2018-04-13 06:23:16,655 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:23:16,655 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:23:16,656 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:16,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:23:16,656 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:16,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:23:16,661 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:23:16,663 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:23:16,663 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:23:16,663 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:23:16,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:23:16,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:23:16,676 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:23:16,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 06:23:16,680 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:16,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:16,681 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-13 06:23:16,686 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:16,687 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:16,687 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 06:23:16,687 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:16,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:16,691 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-04-13 06:23:16,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-13 06:23:16,699 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 06:23:16,700 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:16,701 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:16,705 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 06:23:16,705 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:27 [2018-04-13 06:23:16,723 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 45 treesize of output 39 [2018-04-13 06:23:16,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-13 06:23:16,725 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:16,728 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:16,732 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 06:23:16,733 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:27 [2018-04-13 06:23:16,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-04-13 06:23:16,745 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 06:23:16,745 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:16,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:16,751 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:23:16,751 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:15 [2018-04-13 06:23:16,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 06:23:16,760 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:23:16,761 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-13 06:23:16,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-13 06:23:16,761 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-13 06:23:16,761 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-04-13 06:23:16,761 INFO L87 Difference]: Start difference. First operand 433 states and 589 transitions. Second operand 9 states. [2018-04-13 06:23:17,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:23:17,162 INFO L93 Difference]: Finished difference Result 692 states and 917 transitions. [2018-04-13 06:23:17,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-13 06:23:17,163 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-04-13 06:23:17,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:23:17,164 INFO L225 Difference]: With dead ends: 692 [2018-04-13 06:23:17,164 INFO L226 Difference]: Without dead ends: 692 [2018-04-13 06:23:17,164 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2018-04-13 06:23:17,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2018-04-13 06:23:17,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 438. [2018-04-13 06:23:17,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2018-04-13 06:23:17,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 595 transitions. [2018-04-13 06:23:17,168 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 595 transitions. Word has length 35 [2018-04-13 06:23:17,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:23:17,168 INFO L459 AbstractCegarLoop]: Abstraction has 438 states and 595 transitions. [2018-04-13 06:23:17,168 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-13 06:23:17,168 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 595 transitions. [2018-04-13 06:23:17,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-13 06:23:17,168 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:23:17,168 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:23:17,168 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:23:17,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1086725401, now seen corresponding path program 1 times [2018-04-13 06:23:17,168 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:23:17,168 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:23:17,169 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:17,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:23:17,169 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:17,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:23:17,173 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:23:17,176 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:23:17,176 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:23:17,176 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:23:17,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:23:17,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:23:17,188 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:23:17,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 06:23:17,202 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:17,206 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:17,206 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-04-13 06:23:17,214 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 06:23:17,215 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 06:23:17,215 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:17,216 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:17,223 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 06:23:17,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 06:23:17,224 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:17,226 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:17,251 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 06:23:17,251 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:39, output treesize:34 [2018-04-13 06:23:17,294 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 45 treesize of output 53 [2018-04-13 06:23:17,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2018-04-13 06:23:17,309 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:17,325 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:17,342 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 54 [2018-04-13 06:23:17,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 46 [2018-04-13 06:23:17,345 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:17,355 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:17,360 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:23:17,360 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:74, output treesize:53 [2018-04-13 06:23:17,512 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:17,513 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:17,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2018-04-13 06:23:17,519 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 21 [2018-04-13 06:23:17,520 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:17,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2018-04-13 06:23:17,524 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:17,527 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:17,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-13 06:23:17,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-13 06:23:17,532 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:17,533 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:17,536 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 06:23:17,536 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:61, output treesize:13 [2018-04-13 06:23:17,547 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 06:23:17,547 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:23:17,547 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-04-13 06:23:17,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-13 06:23:17,547 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-13 06:23:17,547 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-04-13 06:23:17,548 INFO L87 Difference]: Start difference. First operand 438 states and 595 transitions. Second operand 14 states. [2018-04-13 06:23:18,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:23:18,296 INFO L93 Difference]: Finished difference Result 749 states and 997 transitions. [2018-04-13 06:23:18,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-13 06:23:18,296 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2018-04-13 06:23:18,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:23:18,297 INFO L225 Difference]: With dead ends: 749 [2018-04-13 06:23:18,297 INFO L226 Difference]: Without dead ends: 749 [2018-04-13 06:23:18,298 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=203, Invalid=553, Unknown=0, NotChecked=0, Total=756 [2018-04-13 06:23:18,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2018-04-13 06:23:18,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 438. [2018-04-13 06:23:18,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2018-04-13 06:23:18,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 594 transitions. [2018-04-13 06:23:18,302 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 594 transitions. Word has length 35 [2018-04-13 06:23:18,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:23:18,303 INFO L459 AbstractCegarLoop]: Abstraction has 438 states and 594 transitions. [2018-04-13 06:23:18,303 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-13 06:23:18,303 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 594 transitions. [2018-04-13 06:23:18,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-13 06:23:18,303 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:23:18,303 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:23:18,304 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:23:18,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1464376684, now seen corresponding path program 1 times [2018-04-13 06:23:18,304 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:23:18,304 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:23:18,305 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:18,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:23:18,305 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:18,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:23:18,311 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:23:18,331 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 06:23:18,332 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:23:18,332 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 06:23:18,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 06:23:18,332 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 06:23:18,332 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 06:23:18,333 INFO L87 Difference]: Start difference. First operand 438 states and 594 transitions. Second operand 4 states. [2018-04-13 06:23:18,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:23:18,568 INFO L93 Difference]: Finished difference Result 1183 states and 1640 transitions. [2018-04-13 06:23:18,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 06:23:18,568 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-04-13 06:23:18,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:23:18,572 INFO L225 Difference]: With dead ends: 1183 [2018-04-13 06:23:18,572 INFO L226 Difference]: Without dead ends: 1183 [2018-04-13 06:23:18,572 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 06:23:18,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2018-04-13 06:23:18,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 435. [2018-04-13 06:23:18,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-04-13 06:23:18,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 592 transitions. [2018-04-13 06:23:18,579 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 592 transitions. Word has length 35 [2018-04-13 06:23:18,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:23:18,579 INFO L459 AbstractCegarLoop]: Abstraction has 435 states and 592 transitions. [2018-04-13 06:23:18,579 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 06:23:18,580 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 592 transitions. [2018-04-13 06:23:18,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-13 06:23:18,580 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:23:18,580 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:23:18,580 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:23:18,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1464376685, now seen corresponding path program 1 times [2018-04-13 06:23:18,580 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:23:18,581 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:23:18,581 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:18,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:23:18,581 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:18,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:23:18,593 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:23:18,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 06:23:18,623 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:23:18,623 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 06:23:18,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 06:23:18,624 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 06:23:18,624 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 06:23:18,624 INFO L87 Difference]: Start difference. First operand 435 states and 592 transitions. Second operand 4 states. [2018-04-13 06:23:18,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:23:18,725 INFO L93 Difference]: Finished difference Result 437 states and 593 transitions. [2018-04-13 06:23:18,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-13 06:23:18,726 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-04-13 06:23:18,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:23:18,726 INFO L225 Difference]: With dead ends: 437 [2018-04-13 06:23:18,727 INFO L226 Difference]: Without dead ends: 437 [2018-04-13 06:23:18,727 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 06:23:18,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2018-04-13 06:23:18,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 436. [2018-04-13 06:23:18,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2018-04-13 06:23:18,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 592 transitions. [2018-04-13 06:23:18,729 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 592 transitions. Word has length 35 [2018-04-13 06:23:18,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:23:18,730 INFO L459 AbstractCegarLoop]: Abstraction has 436 states and 592 transitions. [2018-04-13 06:23:18,730 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 06:23:18,730 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 592 transitions. [2018-04-13 06:23:18,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-13 06:23:18,730 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:23:18,730 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:23:18,730 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:23:18,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1299151849, now seen corresponding path program 1 times [2018-04-13 06:23:18,730 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:23:18,730 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:23:18,731 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:18,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:23:18,731 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:18,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:23:18,735 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:23:18,737 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:23:18,737 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:23:18,737 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:23:18,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:23:18,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:23:18,749 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:23:18,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 06:23:18,759 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:18,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:18,761 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 06:23:18,770 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 06:23:18,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 06:23:18,771 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:18,772 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:18,778 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 06:23:18,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 06:23:18,779 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:18,780 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:18,784 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:18,784 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2018-04-13 06:23:18,792 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:18,793 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:18,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 06:23:18,794 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:18,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:18,798 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:26 [2018-04-13 06:23:18,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-04-13 06:23:18,810 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:18,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-13 06:23:18,811 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:18,814 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:18,849 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 23 treesize of output 18 [2018-04-13 06:23:18,852 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:18,853 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 06:23:18,854 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:18,858 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:18,867 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 06:23:18,867 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:52, output treesize:32 [2018-04-13 06:23:18,897 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 06:23:18,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 06:23:18,899 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:18,902 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:18,913 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 56 treesize of output 50 [2018-04-13 06:23:18,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 06:23:18,914 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:18,919 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:18,925 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:18,925 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:78, output treesize:32 [2018-04-13 06:23:18,935 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 25 treesize of output 19 [2018-04-13 06:23:18,937 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:18,937 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:23:18,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2018-04-13 06:23:18,939 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:18,941 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:18,945 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 17 treesize of output 13 [2018-04-13 06:23:18,946 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:23:18,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-04-13 06:23:18,946 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:18,947 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:18,949 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 06:23:18,949 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:44, output treesize:10 [2018-04-13 06:23:18,963 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 06:23:18,964 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:23:18,964 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-04-13 06:23:18,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-13 06:23:18,964 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-13 06:23:18,964 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-04-13 06:23:18,964 INFO L87 Difference]: Start difference. First operand 436 states and 592 transitions. Second operand 11 states. [2018-04-13 06:23:19,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:23:19,436 INFO L93 Difference]: Finished difference Result 664 states and 882 transitions. [2018-04-13 06:23:19,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-13 06:23:19,436 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2018-04-13 06:23:19,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:23:19,437 INFO L225 Difference]: With dead ends: 664 [2018-04-13 06:23:19,437 INFO L226 Difference]: Without dead ends: 664 [2018-04-13 06:23:19,437 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2018-04-13 06:23:19,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2018-04-13 06:23:19,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 434. [2018-04-13 06:23:19,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-04-13 06:23:19,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 589 transitions. [2018-04-13 06:23:19,441 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 589 transitions. Word has length 36 [2018-04-13 06:23:19,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:23:19,441 INFO L459 AbstractCegarLoop]: Abstraction has 434 states and 589 transitions. [2018-04-13 06:23:19,441 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-13 06:23:19,441 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 589 transitions. [2018-04-13 06:23:19,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-13 06:23:19,441 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:23:19,441 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:23:19,441 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:23:19,441 INFO L82 PathProgramCache]: Analyzing trace with hash 827290309, now seen corresponding path program 1 times [2018-04-13 06:23:19,441 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:23:19,442 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:23:19,442 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:19,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:23:19,442 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:19,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:23:19,447 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:23:19,450 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:23:19,450 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:23:19,450 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:23:19,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:23:19,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:23:19,462 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:23:19,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 06:23:19,465 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:19,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:19,466 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-13 06:23:19,470 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:19,471 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:19,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 06:23:19,471 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:19,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:19,473 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-04-13 06:23:19,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-13 06:23:19,479 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:19,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-13 06:23:19,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 06:23:19,486 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:19,488 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:19,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-13 06:23:19,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 06:23:19,494 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:19,495 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:19,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:19,499 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:36, output treesize:20 [2018-04-13 06:23:19,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-04-13 06:23:19,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-04-13 06:23:19,507 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:19,508 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:19,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:19,510 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:14 [2018-04-13 06:23:19,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-04-13 06:23:19,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 06:23:19,521 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:19,524 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:19,527 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 06:23:19,527 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 06:23:19,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-13 06:23:19,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-04-13 06:23:19,558 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:19,559 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:19,560 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 06:23:19,560 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-04-13 06:23:19,569 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 06:23:19,570 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:23:19,570 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-13 06:23:19,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-13 06:23:19,570 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-13 06:23:19,570 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-04-13 06:23:19,570 INFO L87 Difference]: Start difference. First operand 434 states and 589 transitions. Second operand 10 states. [2018-04-13 06:23:19,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:23:19,997 INFO L93 Difference]: Finished difference Result 700 states and 887 transitions. [2018-04-13 06:23:19,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-13 06:23:19,997 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2018-04-13 06:23:19,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:23:19,999 INFO L225 Difference]: With dead ends: 700 [2018-04-13 06:23:19,999 INFO L226 Difference]: Without dead ends: 700 [2018-04-13 06:23:19,999 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=357, Unknown=0, NotChecked=0, Total=462 [2018-04-13 06:23:19,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2018-04-13 06:23:20,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 437. [2018-04-13 06:23:20,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2018-04-13 06:23:20,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 593 transitions. [2018-04-13 06:23:20,002 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 593 transitions. Word has length 38 [2018-04-13 06:23:20,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:23:20,002 INFO L459 AbstractCegarLoop]: Abstraction has 437 states and 593 transitions. [2018-04-13 06:23:20,002 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-13 06:23:20,002 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 593 transitions. [2018-04-13 06:23:20,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-13 06:23:20,003 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:23:20,003 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:23:20,003 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:23:20,003 INFO L82 PathProgramCache]: Analyzing trace with hash 827291432, now seen corresponding path program 1 times [2018-04-13 06:23:20,003 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:23:20,003 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:23:20,004 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:20,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:23:20,004 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:20,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:23:20,009 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:23:20,032 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 06:23:20,032 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:23:20,032 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 06:23:20,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 06:23:20,033 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 06:23:20,033 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-13 06:23:20,033 INFO L87 Difference]: Start difference. First operand 437 states and 593 transitions. Second operand 5 states. [2018-04-13 06:23:20,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:23:20,152 INFO L93 Difference]: Finished difference Result 436 states and 589 transitions. [2018-04-13 06:23:20,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 06:23:20,152 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-04-13 06:23:20,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:23:20,153 INFO L225 Difference]: With dead ends: 436 [2018-04-13 06:23:20,153 INFO L226 Difference]: Without dead ends: 436 [2018-04-13 06:23:20,153 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-04-13 06:23:20,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2018-04-13 06:23:20,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 436. [2018-04-13 06:23:20,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2018-04-13 06:23:20,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 589 transitions. [2018-04-13 06:23:20,156 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 589 transitions. Word has length 38 [2018-04-13 06:23:20,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:23:20,156 INFO L459 AbstractCegarLoop]: Abstraction has 436 states and 589 transitions. [2018-04-13 06:23:20,156 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 06:23:20,156 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 589 transitions. [2018-04-13 06:23:20,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-13 06:23:20,157 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:23:20,157 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:23:20,157 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:23:20,157 INFO L82 PathProgramCache]: Analyzing trace with hash 827291433, now seen corresponding path program 1 times [2018-04-13 06:23:20,157 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:23:20,157 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:23:20,158 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:20,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:23:20,158 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:20,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:23:20,165 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:23:20,196 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 06:23:20,196 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:23:20,196 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 06:23:20,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 06:23:20,197 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 06:23:20,197 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-13 06:23:20,197 INFO L87 Difference]: Start difference. First operand 436 states and 589 transitions. Second operand 5 states. [2018-04-13 06:23:20,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:23:20,335 INFO L93 Difference]: Finished difference Result 435 states and 585 transitions. [2018-04-13 06:23:20,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 06:23:20,335 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-04-13 06:23:20,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:23:20,336 INFO L225 Difference]: With dead ends: 435 [2018-04-13 06:23:20,336 INFO L226 Difference]: Without dead ends: 435 [2018-04-13 06:23:20,336 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-04-13 06:23:20,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2018-04-13 06:23:20,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 435. [2018-04-13 06:23:20,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-04-13 06:23:20,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 585 transitions. [2018-04-13 06:23:20,339 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 585 transitions. Word has length 38 [2018-04-13 06:23:20,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:23:20,339 INFO L459 AbstractCegarLoop]: Abstraction has 435 states and 585 transitions. [2018-04-13 06:23:20,339 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 06:23:20,339 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 585 transitions. [2018-04-13 06:23:20,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-13 06:23:20,340 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:23:20,340 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:23:20,340 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:23:20,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1263089809, now seen corresponding path program 1 times [2018-04-13 06:23:20,340 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:23:20,340 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:23:20,340 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:20,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:23:20,340 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:20,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:23:20,345 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:23:20,346 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:23:20,346 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:23:20,346 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:23:20,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:23:20,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:23:20,357 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:23:20,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 06:23:20,362 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:20,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:20,364 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 06:23:20,379 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:20,379 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:20,380 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 06:23:20,380 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:20,388 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:20,389 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:20,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 06:23:20,390 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:20,394 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 06:23:20,395 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2018-04-13 06:23:20,423 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 06:23:20,423 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:23:20,423 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-13 06:23:20,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-13 06:23:20,424 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-13 06:23:20,424 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-13 06:23:20,424 INFO L87 Difference]: Start difference. First operand 435 states and 585 transitions. Second operand 6 states. [2018-04-13 06:23:20,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:23:20,709 INFO L93 Difference]: Finished difference Result 917 states and 1265 transitions. [2018-04-13 06:23:20,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-13 06:23:20,709 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2018-04-13 06:23:20,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:23:20,710 INFO L225 Difference]: With dead ends: 917 [2018-04-13 06:23:20,711 INFO L226 Difference]: Without dead ends: 917 [2018-04-13 06:23:20,711 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-04-13 06:23:20,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2018-04-13 06:23:20,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 439. [2018-04-13 06:23:20,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2018-04-13 06:23:20,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 589 transitions. [2018-04-13 06:23:20,716 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 589 transitions. Word has length 38 [2018-04-13 06:23:20,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:23:20,716 INFO L459 AbstractCegarLoop]: Abstraction has 439 states and 589 transitions. [2018-04-13 06:23:20,716 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-13 06:23:20,716 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 589 transitions. [2018-04-13 06:23:20,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-13 06:23:20,716 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:23:20,716 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:23:20,717 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:23:20,717 INFO L82 PathProgramCache]: Analyzing trace with hash -123803838, now seen corresponding path program 1 times [2018-04-13 06:23:20,717 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:23:20,717 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:23:20,717 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:20,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:23:20,717 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:20,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:23:20,722 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:23:20,742 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 06:23:20,743 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:23:20,743 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 06:23:20,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 06:23:20,743 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 06:23:20,743 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-13 06:23:20,744 INFO L87 Difference]: Start difference. First operand 439 states and 589 transitions. Second operand 5 states. [2018-04-13 06:23:20,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:23:20,856 INFO L93 Difference]: Finished difference Result 438 states and 585 transitions. [2018-04-13 06:23:20,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 06:23:20,857 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-04-13 06:23:20,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:23:20,858 INFO L225 Difference]: With dead ends: 438 [2018-04-13 06:23:20,858 INFO L226 Difference]: Without dead ends: 438 [2018-04-13 06:23:20,858 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-04-13 06:23:20,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2018-04-13 06:23:20,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 438. [2018-04-13 06:23:20,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2018-04-13 06:23:20,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 585 transitions. [2018-04-13 06:23:20,861 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 585 transitions. Word has length 39 [2018-04-13 06:23:20,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:23:20,861 INFO L459 AbstractCegarLoop]: Abstraction has 438 states and 585 transitions. [2018-04-13 06:23:20,861 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 06:23:20,861 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 585 transitions. [2018-04-13 06:23:20,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-13 06:23:20,861 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:23:20,862 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:23:20,862 INFO L408 AbstractCegarLoop]: === Iteration 33 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:23:20,862 INFO L82 PathProgramCache]: Analyzing trace with hash -247563480, now seen corresponding path program 1 times [2018-04-13 06:23:20,862 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:23:20,862 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:23:20,862 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:20,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:23:20,862 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:20,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:23:20,867 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:23:20,878 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 06:23:20,878 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:23:20,879 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 06:23:20,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 06:23:20,879 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 06:23:20,879 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 06:23:20,879 INFO L87 Difference]: Start difference. First operand 438 states and 585 transitions. Second operand 4 states. [2018-04-13 06:23:21,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:23:21,042 INFO L93 Difference]: Finished difference Result 1169 states and 1590 transitions. [2018-04-13 06:23:21,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 06:23:21,042 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-04-13 06:23:21,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:23:21,044 INFO L225 Difference]: With dead ends: 1169 [2018-04-13 06:23:21,044 INFO L226 Difference]: Without dead ends: 1169 [2018-04-13 06:23:21,045 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 06:23:21,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2018-04-13 06:23:21,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 437. [2018-04-13 06:23:21,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2018-04-13 06:23:21,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 584 transitions. [2018-04-13 06:23:21,050 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 584 transitions. Word has length 39 [2018-04-13 06:23:21,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:23:21,050 INFO L459 AbstractCegarLoop]: Abstraction has 437 states and 584 transitions. [2018-04-13 06:23:21,050 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 06:23:21,050 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 584 transitions. [2018-04-13 06:23:21,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-13 06:23:21,050 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:23:21,050 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:23:21,050 INFO L408 AbstractCegarLoop]: === Iteration 34 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:23:21,051 INFO L82 PathProgramCache]: Analyzing trace with hash -247563479, now seen corresponding path program 1 times [2018-04-13 06:23:21,051 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:23:21,051 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:23:21,051 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:21,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:23:21,051 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:21,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:23:21,056 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:23:21,078 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 06:23:21,079 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:23:21,079 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 06:23:21,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 06:23:21,079 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 06:23:21,079 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 06:23:21,079 INFO L87 Difference]: Start difference. First operand 437 states and 584 transitions. Second operand 4 states. [2018-04-13 06:23:21,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:23:21,167 INFO L93 Difference]: Finished difference Result 435 states and 582 transitions. [2018-04-13 06:23:21,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-13 06:23:21,167 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-04-13 06:23:21,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:23:21,168 INFO L225 Difference]: With dead ends: 435 [2018-04-13 06:23:21,168 INFO L226 Difference]: Without dead ends: 435 [2018-04-13 06:23:21,168 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 06:23:21,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2018-04-13 06:23:21,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 435. [2018-04-13 06:23:21,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-04-13 06:23:21,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 582 transitions. [2018-04-13 06:23:21,171 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 582 transitions. Word has length 39 [2018-04-13 06:23:21,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:23:21,171 INFO L459 AbstractCegarLoop]: Abstraction has 435 states and 582 transitions. [2018-04-13 06:23:21,171 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 06:23:21,171 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 582 transitions. [2018-04-13 06:23:21,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-13 06:23:21,171 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:23:21,171 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:23:21,172 INFO L408 AbstractCegarLoop]: === Iteration 35 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:23:21,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1316978381, now seen corresponding path program 1 times [2018-04-13 06:23:21,172 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:23:21,172 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:23:21,172 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:21,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:23:21,172 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:21,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:23:21,177 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:23:21,179 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:23:21,179 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:23:21,179 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:23:21,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:23:21,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:23:21,197 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:23:21,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 06:23:21,204 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:21,206 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:21,207 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-13 06:23:21,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 06:23:21,215 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 06:23:21,215 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:21,216 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:21,222 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 06:23:21,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 06:23:21,224 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:21,225 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:21,229 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 06:23:21,229 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:35, output treesize:24 [2018-04-13 06:23:21,298 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 71 [2018-04-13 06:23:21,302 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:21,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 66 [2018-04-13 06:23:21,304 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 06:23:21,314 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:23:21,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 61 treesize of output 60 [2018-04-13 06:23:21,334 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:21,342 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:21,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 62 [2018-04-13 06:23:21,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 48 [2018-04-13 06:23:21,375 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:21,389 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:21,397 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 06:23:21,397 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:94, output treesize:74 [2018-04-13 06:23:21,626 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 25 treesize of output 7 [2018-04-13 06:23:21,626 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:21,646 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:21,647 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 75 treesize of output 59 [2018-04-13 06:23:21,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 38 [2018-04-13 06:23:21,681 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:21,699 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:23:21,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2018-04-13 06:23:21,699 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:21,705 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:21,718 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 44 treesize of output 34 [2018-04-13 06:23:21,720 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 30 treesize of output 23 [2018-04-13 06:23:21,720 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:21,726 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:23:21,727 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 23 treesize of output 10 [2018-04-13 06:23:21,727 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:21,731 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:21,738 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:21,738 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:134, output treesize:10 [2018-04-13 06:23:21,763 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 06:23:21,763 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:23:21,763 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-04-13 06:23:21,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-13 06:23:21,764 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-13 06:23:21,764 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2018-04-13 06:23:21,764 INFO L87 Difference]: Start difference. First operand 435 states and 582 transitions. Second operand 16 states. [2018-04-13 06:23:22,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:23:22,693 INFO L93 Difference]: Finished difference Result 687 states and 911 transitions. [2018-04-13 06:23:22,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-13 06:23:22,694 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 41 [2018-04-13 06:23:22,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:23:22,695 INFO L225 Difference]: With dead ends: 687 [2018-04-13 06:23:22,695 INFO L226 Difference]: Without dead ends: 687 [2018-04-13 06:23:22,695 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=240, Invalid=752, Unknown=0, NotChecked=0, Total=992 [2018-04-13 06:23:22,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2018-04-13 06:23:22,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 435. [2018-04-13 06:23:22,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-04-13 06:23:22,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 581 transitions. [2018-04-13 06:23:22,698 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 581 transitions. Word has length 41 [2018-04-13 06:23:22,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:23:22,698 INFO L459 AbstractCegarLoop]: Abstraction has 435 states and 581 transitions. [2018-04-13 06:23:22,698 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-13 06:23:22,698 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 581 transitions. [2018-04-13 06:23:22,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-13 06:23:22,699 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:23:22,699 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:23:22,699 INFO L408 AbstractCegarLoop]: === Iteration 36 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:23:22,699 INFO L82 PathProgramCache]: Analyzing trace with hash 500119061, now seen corresponding path program 1 times [2018-04-13 06:23:22,699 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:23:22,699 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:23:22,700 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:22,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:23:22,700 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:22,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:23:22,704 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:23:22,726 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 06:23:22,726 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:23:22,726 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 06:23:22,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 06:23:22,726 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 06:23:22,726 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-13 06:23:22,726 INFO L87 Difference]: Start difference. First operand 435 states and 581 transitions. Second operand 5 states. [2018-04-13 06:23:22,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:23:22,879 INFO L93 Difference]: Finished difference Result 672 states and 901 transitions. [2018-04-13 06:23:22,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 06:23:22,880 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-04-13 06:23:22,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:23:22,881 INFO L225 Difference]: With dead ends: 672 [2018-04-13 06:23:22,881 INFO L226 Difference]: Without dead ends: 672 [2018-04-13 06:23:22,881 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-13 06:23:22,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2018-04-13 06:23:22,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 434. [2018-04-13 06:23:22,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-04-13 06:23:22,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 580 transitions. [2018-04-13 06:23:22,884 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 580 transitions. Word has length 41 [2018-04-13 06:23:22,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:23:22,885 INFO L459 AbstractCegarLoop]: Abstraction has 434 states and 580 transitions. [2018-04-13 06:23:22,885 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 06:23:22,885 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 580 transitions. [2018-04-13 06:23:22,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-13 06:23:22,885 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:23:22,885 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:23:22,885 INFO L408 AbstractCegarLoop]: === Iteration 37 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:23:22,885 INFO L82 PathProgramCache]: Analyzing trace with hash 500119062, now seen corresponding path program 1 times [2018-04-13 06:23:22,885 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:23:22,885 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:23:22,886 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:22,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:23:22,886 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:22,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:23:22,889 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:23:22,916 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 06:23:22,917 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:23:22,917 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 06:23:22,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 06:23:22,917 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 06:23:22,917 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-13 06:23:22,917 INFO L87 Difference]: Start difference. First operand 434 states and 580 transitions. Second operand 5 states. [2018-04-13 06:23:23,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:23:23,086 INFO L93 Difference]: Finished difference Result 666 states and 890 transitions. [2018-04-13 06:23:23,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 06:23:23,086 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-04-13 06:23:23,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:23:23,087 INFO L225 Difference]: With dead ends: 666 [2018-04-13 06:23:23,088 INFO L226 Difference]: Without dead ends: 666 [2018-04-13 06:23:23,088 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-13 06:23:23,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2018-04-13 06:23:23,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 433. [2018-04-13 06:23:23,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2018-04-13 06:23:23,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 579 transitions. [2018-04-13 06:23:23,090 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 579 transitions. Word has length 41 [2018-04-13 06:23:23,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:23:23,091 INFO L459 AbstractCegarLoop]: Abstraction has 433 states and 579 transitions. [2018-04-13 06:23:23,091 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 06:23:23,091 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 579 transitions. [2018-04-13 06:23:23,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-13 06:23:23,091 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:23:23,091 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:23:23,091 INFO L408 AbstractCegarLoop]: === Iteration 38 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:23:23,091 INFO L82 PathProgramCache]: Analyzing trace with hash -704663211, now seen corresponding path program 1 times [2018-04-13 06:23:23,091 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:23:23,091 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:23:23,092 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:23,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:23:23,092 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:23,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:23:23,097 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:23:23,099 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:23:23,099 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:23:23,099 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:23:23,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:23:23,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:23:23,108 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:23:23,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 06:23:23,110 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:23,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:23,112 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 06:23:23,126 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:23,127 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:23,127 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 06:23:23,127 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:23,136 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:23,136 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:23,137 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 06:23:23,137 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:23,141 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 06:23:23,142 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2018-04-13 06:23:23,149 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 06:23:23,149 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:23:23,150 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-13 06:23:23,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-13 06:23:23,150 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-13 06:23:23,150 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-13 06:23:23,150 INFO L87 Difference]: Start difference. First operand 433 states and 579 transitions. Second operand 6 states. [2018-04-13 06:23:23,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:23:23,391 INFO L93 Difference]: Finished difference Result 904 states and 1242 transitions. [2018-04-13 06:23:23,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-13 06:23:23,392 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2018-04-13 06:23:23,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:23:23,393 INFO L225 Difference]: With dead ends: 904 [2018-04-13 06:23:23,393 INFO L226 Difference]: Without dead ends: 904 [2018-04-13 06:23:23,393 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-04-13 06:23:23,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2018-04-13 06:23:23,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 424. [2018-04-13 06:23:23,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-04-13 06:23:23,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 570 transitions. [2018-04-13 06:23:23,397 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 570 transitions. Word has length 42 [2018-04-13 06:23:23,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:23:23,397 INFO L459 AbstractCegarLoop]: Abstraction has 424 states and 570 transitions. [2018-04-13 06:23:23,397 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-13 06:23:23,397 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 570 transitions. [2018-04-13 06:23:23,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-13 06:23:23,398 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:23:23,398 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:23:23,398 INFO L408 AbstractCegarLoop]: === Iteration 39 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:23:23,398 INFO L82 PathProgramCache]: Analyzing trace with hash 891196517, now seen corresponding path program 1 times [2018-04-13 06:23:23,398 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:23:23,398 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:23:23,398 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:23,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:23:23,399 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:23,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:23:23,402 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:23:23,404 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:23:23,404 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:23:23,404 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:23:23,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:23:23,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:23:23,419 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:23:23,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, 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 06:23:23,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, 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 06:23:23,438 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:23,440 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:23,447 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 06:23:23,449 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 06:23:23,449 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:23,450 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:23,456 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 06:23:23,456 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:34, output treesize:23 [2018-04-13 06:23:23,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-13 06:23:23,466 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 06:23:23,466 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:23,467 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:23,471 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:23,471 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:26 [2018-04-13 06:23:23,496 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 45 [2018-04-13 06:23:23,497 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 41 treesize of output 40 [2018-04-13 06:23:23,498 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:23,505 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:23,509 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 06:23:23,509 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:39 [2018-04-13 06:23:23,646 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:23,647 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:23,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 41 [2018-04-13 06:23:23,651 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:23,652 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:23:23,663 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 58 [2018-04-13 06:23:23,665 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-04-13 06:23:23,682 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 18 treesize of output 9 [2018-04-13 06:23:23,682 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:23,685 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:23,700 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 06:23:23,701 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:54, output treesize:17 [2018-04-13 06:23:23,727 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:23,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-13 06:23:23,728 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:23,734 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 06:23:23,735 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:18 [2018-04-13 06:23:23,775 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 06:23:23,775 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:23:23,776 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-04-13 06:23:23,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-13 06:23:23,776 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-13 06:23:23,776 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2018-04-13 06:23:23,776 INFO L87 Difference]: Start difference. First operand 424 states and 570 transitions. Second operand 16 states. [2018-04-13 06:23:24,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:23:24,507 INFO L93 Difference]: Finished difference Result 452 states and 599 transitions. [2018-04-13 06:23:24,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-13 06:23:24,507 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 43 [2018-04-13 06:23:24,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:23:24,508 INFO L225 Difference]: With dead ends: 452 [2018-04-13 06:23:24,508 INFO L226 Difference]: Without dead ends: 452 [2018-04-13 06:23:24,508 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=251, Invalid=805, Unknown=0, NotChecked=0, Total=1056 [2018-04-13 06:23:24,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2018-04-13 06:23:24,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 429. [2018-04-13 06:23:24,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2018-04-13 06:23:24,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 575 transitions. [2018-04-13 06:23:24,511 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 575 transitions. Word has length 43 [2018-04-13 06:23:24,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:23:24,511 INFO L459 AbstractCegarLoop]: Abstraction has 429 states and 575 transitions. [2018-04-13 06:23:24,511 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-13 06:23:24,511 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 575 transitions. [2018-04-13 06:23:24,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-13 06:23:24,511 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:23:24,511 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:23:24,511 INFO L408 AbstractCegarLoop]: === Iteration 40 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:23:24,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1802679286, now seen corresponding path program 1 times [2018-04-13 06:23:24,511 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:23:24,511 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:23:24,512 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:24,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:23:24,512 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:24,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:23:24,516 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:23:24,518 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:23:24,518 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:23:24,518 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:23:24,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:23:24,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:23:24,533 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:23:24,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-13 06:23:24,539 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:24,554 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 06:23:24,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 06:23:24,555 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:24,556 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:24,562 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 06:23:24,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 06:23:24,563 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:24,564 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:24,568 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:24,568 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:34, output treesize:21 [2018-04-13 06:23:24,576 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 06:23:24,578 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:24,578 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 06:23:24,579 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:24,595 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:24,608 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 06:23:24,610 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:24,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 06:23:24,611 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:24,616 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:24,624 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:24,624 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-04-13 06:23:24,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 06:23:24,639 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:24,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:24,649 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:44 [2018-04-13 06:23:24,665 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-04-13 06:23:24,667 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:24,667 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:24,668 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:24,670 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 06:23:24,670 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:24,677 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:24,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 06:23:24,693 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:24,694 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:24,695 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:24,697 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 06:23:24,697 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:24,703 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:24,714 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 06:23:24,714 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:75, output treesize:55 [2018-04-13 06:23:24,797 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 73 [2018-04-13 06:23:24,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 74 [2018-04-13 06:23:24,801 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:24,833 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:24,833 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:24,835 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:24,852 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 1 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 82 [2018-04-13 06:23:24,854 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 8 xjuncts. [2018-04-13 06:23:24,936 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-13 06:23:24,984 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 61 treesize of output 54 [2018-04-13 06:23:24,987 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:24,987 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:24,991 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:24,993 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 42 [2018-04-13 06:23:24,993 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:25,005 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:25,025 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 61 treesize of output 54 [2018-04-13 06:23:25,028 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:25,031 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 21 treesize of output 32 [2018-04-13 06:23:25,031 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:25,041 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:25,053 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 80 treesize of output 96 [2018-04-13 06:23:25,056 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:25,088 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 4 case distinctions, treesize of input 76 treesize of output 107 [2018-04-13 06:23:25,088 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 4 xjuncts. [2018-04-13 06:23:25,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 70 [2018-04-13 06:23:25,149 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:25,185 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-13 06:23:25,188 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 61 treesize of output 54 [2018-04-13 06:23:25,190 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:25,192 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 21 treesize of output 32 [2018-04-13 06:23:25,192 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:25,202 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:25,281 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-13 06:23:25,281 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:101, output treesize:189 [2018-04-13 06:23:25,343 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:25,344 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:25,345 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 66 treesize of output 67 [2018-04-13 06:23:25,346 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:25,393 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 60 treesize of output 59 [2018-04-13 06:23:25,393 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:25,438 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:25,438 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:25,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 61 [2018-04-13 06:23:25,439 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:25,481 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:25,482 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:25,482 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 51 treesize of output 52 [2018-04-13 06:23:25,483 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:25,523 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 44 [2018-04-13 06:23:25,523 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:25,566 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:25,567 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:25,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 56 [2018-04-13 06:23:25,567 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:25,606 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 49 treesize of output 48 [2018-04-13 06:23:25,607 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:25,645 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 54 treesize of output 53 [2018-04-13 06:23:25,646 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:25,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-13 06:23:25,681 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:233, output treesize:205 [2018-04-13 06:23:25,775 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:25,776 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:25,777 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2018-04-13 06:23:25,777 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:25,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:25,823 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:233, output treesize:53 [2018-04-13 06:23:25,845 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 38 treesize of output 39 [2018-04-13 06:23:25,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 06:23:25,846 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:25,852 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:25,871 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 06:23:25,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, 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 06:23:25,872 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:25,876 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:25,885 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 06:23:25,886 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:75, output treesize:53 [2018-04-13 06:23:25,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, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 67 [2018-04-13 06:23:25,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-13 06:23:25,911 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:25,917 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:25,930 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 40 treesize of output 41 [2018-04-13 06:23:25,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-13 06:23:25,931 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:25,935 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:25,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:23:25,945 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:99, output treesize:63 [2018-04-13 06:23:25,983 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 48 treesize of output 39 [2018-04-13 06:23:25,985 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:25,985 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:23:25,986 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:25,987 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:26,000 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 26 treesize of output 31 [2018-04-13 06:23:26,001 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:26,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-04-13 06:23:26,007 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:26,008 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:26,014 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 24 treesize of output 18 [2018-04-13 06:23:26,015 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:23:26,016 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:26,016 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 18 treesize of output 13 [2018-04-13 06:23:26,016 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:26,018 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:26,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:26,022 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:83, output treesize:7 [2018-04-13 06:23:26,057 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 06:23:26,057 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 06:23:26,057 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-13 06:23:26,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-13 06:23:26,058 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-13 06:23:26,058 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-04-13 06:23:26,058 INFO L87 Difference]: Start difference. First operand 429 states and 575 transitions. Second operand 18 states. [2018-04-13 06:23:35,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:23:35,775 INFO L93 Difference]: Finished difference Result 631 states and 804 transitions. [2018-04-13 06:23:35,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-13 06:23:35,775 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 45 [2018-04-13 06:23:35,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:23:35,776 INFO L225 Difference]: With dead ends: 631 [2018-04-13 06:23:35,776 INFO L226 Difference]: Without dead ends: 631 [2018-04-13 06:23:35,777 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=331, Invalid=1075, Unknown=0, NotChecked=0, Total=1406 [2018-04-13 06:23:35,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2018-04-13 06:23:35,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 446. [2018-04-13 06:23:35,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2018-04-13 06:23:35,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 597 transitions. [2018-04-13 06:23:35,780 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 597 transitions. Word has length 45 [2018-04-13 06:23:35,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:23:35,780 INFO L459 AbstractCegarLoop]: Abstraction has 446 states and 597 transitions. [2018-04-13 06:23:35,780 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-13 06:23:35,780 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 597 transitions. [2018-04-13 06:23:35,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-13 06:23:35,780 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:23:35,780 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:23:35,781 INFO L408 AbstractCegarLoop]: === Iteration 41 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:23:35,781 INFO L82 PathProgramCache]: Analyzing trace with hash 509694365, now seen corresponding path program 1 times [2018-04-13 06:23:35,781 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:23:35,781 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:23:35,781 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:35,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:23:35,781 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:35,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:23:35,786 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:23:35,787 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:23:35,788 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:23:35,788 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:23:35,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:23:35,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:23:35,807 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:23:35,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 06:23:35,810 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:35,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:35,812 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 06:23:35,821 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 06:23:35,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 8 treesize of output 7 [2018-04-13 06:23:35,822 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:35,823 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:35,830 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 06:23:35,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 8 treesize of output 7 [2018-04-13 06:23:35,831 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:35,832 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:35,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:35,837 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-04-13 06:23:35,847 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 06:23:35,857 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:35,858 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 06:23:35,858 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:35,862 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:35,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-13 06:23:35,873 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:35,874 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 06:23:35,874 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:35,877 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:35,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:35,902 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:52, output treesize:44 [2018-04-13 06:23:35,920 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:35,921 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:35,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 06:23:35,922 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:35,932 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:35,932 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:43 [2018-04-13 06:23:35,952 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 30 treesize of output 23 [2018-04-13 06:23:35,955 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:35,956 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:35,957 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:35,960 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 06:23:35,960 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:35,977 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:35,997 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 30 treesize of output 23 [2018-04-13 06:23:36,000 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:36,001 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:36,001 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:36,004 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 23 treesize of output 46 [2018-04-13 06:23:36,004 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:36,012 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:36,033 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 06:23:36,033 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:74, output treesize:54 [2018-04-13 06:23:36,077 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 40 treesize of output 41 [2018-04-13 06:23:36,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 06:23:36,079 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:36,093 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:36,112 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 63 treesize of output 57 [2018-04-13 06:23:36,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 06:23:36,115 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:36,122 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:36,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:36,136 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:100, output treesize:54 [2018-04-13 06:23:36,139 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:36,140 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:36,140 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 06:23:36,140 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:36,158 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:36,158 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:59, output treesize:53 [2018-04-13 06:23:36,188 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 06:23:36,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 06:23:36,189 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:36,193 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:36,206 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 38 treesize of output 39 [2018-04-13 06:23:36,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 06:23:36,208 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:36,213 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:36,222 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 06:23:36,222 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:75, output treesize:53 [2018-04-13 06:23:36,242 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 40 treesize of output 41 [2018-04-13 06:23:36,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 06:23:36,244 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:36,249 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:36,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 57 [2018-04-13 06:23:36,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-13 06:23:36,266 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:36,271 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:36,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:23:36,279 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:99, output treesize:63 [2018-04-13 06:23:36,322 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 48 treesize of output 39 [2018-04-13 06:23:36,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-04-13 06:23:36,323 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:36,329 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:36,329 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:23:36,330 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:36,330 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:36,332 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 26 treesize of output 31 [2018-04-13 06:23:36,332 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:36,336 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:36,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:23:36,342 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:83, output treesize:36 [2018-04-13 06:23:36,392 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 06:23:36,393 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 06:23:36,393 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-13 06:23:36,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-13 06:23:36,393 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-13 06:23:36,393 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2018-04-13 06:23:36,394 INFO L87 Difference]: Start difference. First operand 446 states and 597 transitions. Second operand 16 states. [2018-04-13 06:23:51,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:23:51,677 INFO L93 Difference]: Finished difference Result 830 states and 1058 transitions. [2018-04-13 06:23:51,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-13 06:23:51,677 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 46 [2018-04-13 06:23:51,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:23:51,679 INFO L225 Difference]: With dead ends: 830 [2018-04-13 06:23:51,679 INFO L226 Difference]: Without dead ends: 830 [2018-04-13 06:23:51,679 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=276, Invalid=716, Unknown=0, NotChecked=0, Total=992 [2018-04-13 06:23:51,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2018-04-13 06:23:51,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 452. [2018-04-13 06:23:51,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2018-04-13 06:23:51,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 603 transitions. [2018-04-13 06:23:51,683 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 603 transitions. Word has length 46 [2018-04-13 06:23:51,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:23:51,683 INFO L459 AbstractCegarLoop]: Abstraction has 452 states and 603 transitions. [2018-04-13 06:23:51,683 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-13 06:23:51,683 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 603 transitions. [2018-04-13 06:23:51,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-13 06:23:51,683 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:23:51,683 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:23:51,684 INFO L408 AbstractCegarLoop]: === Iteration 42 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:23:51,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1319746159, now seen corresponding path program 1 times [2018-04-13 06:23:51,684 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:23:51,684 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:23:51,684 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:51,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:23:51,684 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:51,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:23:51,689 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:23:51,691 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:23:51,691 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:23:51,691 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:23:51,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:23:51,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:23:51,720 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:23:51,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 06:23:51,728 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:51,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:51,729 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2018-04-13 06:23:51,738 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 06:23:51,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 06:23:51,740 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:51,742 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:51,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-13 06:23:51,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 06:23:51,772 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:51,773 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:51,781 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 06:23:51,781 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:38, output treesize:18 [2018-04-13 06:23:51,814 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 52 [2018-04-13 06:23:51,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 47 [2018-04-13 06:23:51,817 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:51,848 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:51,871 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 42 treesize of output 58 [2018-04-13 06:23:51,873 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 42 [2018-04-13 06:23:51,873 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:51,889 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:51,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:51,896 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:73, output treesize:18 [2018-04-13 06:23:51,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 06:23:51,898 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:51,905 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:51,906 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:51,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-13 06:23:51,906 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:51,911 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:51,911 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:26 [2018-04-13 06:23:51,958 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 13 treesize of output 3 [2018-04-13 06:23:51,958 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:51,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-04-13 06:23:51,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 06:23:51,975 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:51,978 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:51,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-04-13 06:23:51,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 06:23:51,993 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:51,997 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:52,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:52,007 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:69, output treesize:32 [2018-04-13 06:23:52,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-13 06:23:52,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-04-13 06:23:52,022 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:52,023 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:52,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:52,029 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:35 [2018-04-13 06:23:52,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 42 [2018-04-13 06:23:52,057 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:52,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 34 [2018-04-13 06:23:52,058 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:52,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 06:23:52,069 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:52,074 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:52,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:23:52,082 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:52, output treesize:49 [2018-04-13 06:23:52,188 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:52,189 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:52,189 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 48 treesize of output 40 [2018-04-13 06:23:52,193 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 23 [2018-04-13 06:23:52,193 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:52,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2018-04-13 06:23:52,198 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:52,200 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:52,203 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 06:23:52,203 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:54, output treesize:5 [2018-04-13 06:23:52,217 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 06:23:52,217 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 06:23:52,217 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-13 06:23:52,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-13 06:23:52,218 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-13 06:23:52,218 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2018-04-13 06:23:52,218 INFO L87 Difference]: Start difference. First operand 452 states and 603 transitions. Second operand 19 states. [2018-04-13 06:23:53,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:23:53,532 INFO L93 Difference]: Finished difference Result 652 states and 825 transitions. [2018-04-13 06:23:53,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-13 06:23:53,533 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 47 [2018-04-13 06:23:53,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:23:53,534 INFO L225 Difference]: With dead ends: 652 [2018-04-13 06:23:53,534 INFO L226 Difference]: Without dead ends: 652 [2018-04-13 06:23:53,535 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=484, Invalid=1586, Unknown=0, NotChecked=0, Total=2070 [2018-04-13 06:23:53,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2018-04-13 06:23:53,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 460. [2018-04-13 06:23:53,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-04-13 06:23:53,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 613 transitions. [2018-04-13 06:23:53,538 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 613 transitions. Word has length 47 [2018-04-13 06:23:53,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:23:53,538 INFO L459 AbstractCegarLoop]: Abstraction has 460 states and 613 transitions. [2018-04-13 06:23:53,538 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-13 06:23:53,538 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 613 transitions. [2018-04-13 06:23:53,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-13 06:23:53,538 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:23:53,538 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:23:53,538 INFO L408 AbstractCegarLoop]: === Iteration 43 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:23:53,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1319746158, now seen corresponding path program 1 times [2018-04-13 06:23:53,538 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:23:53,539 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:23:53,539 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:53,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:23:53,539 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:53,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:23:53,545 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:23:53,547 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:23:53,547 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:23:53,547 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:23:53,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:23:53,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:23:53,586 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:23:53,614 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 06:23:53,614 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:53,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:53,616 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2018-04-13 06:23:53,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 06:23:53,617 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:53,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:53,620 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-13 06:23:53,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 06:23:53,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 06:23:53,629 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:53,631 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:53,639 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 06:23:53,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 06:23:53,640 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:53,642 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:53,648 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 06:23:53,648 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2018-04-13 06:23:53,704 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 61 [2018-04-13 06:23:53,708 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 58 [2018-04-13 06:23:53,708 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:53,746 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 44 treesize of output 39 [2018-04-13 06:23:53,747 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-13 06:23:53,765 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 06:23:53,780 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 38 treesize of output 33 [2018-04-13 06:23:53,782 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 0 case distinctions, treesize of input 16 treesize of output 16 [2018-04-13 06:23:53,782 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:53,786 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:53,795 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 57 treesize of output 75 [2018-04-13 06:23:53,802 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 55 treesize of output 71 [2018-04-13 06:23:53,802 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-04-13 06:23:53,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 48 treesize of output 47 [2018-04-13 06:23:53,822 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:53,835 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 06:23:53,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 06:23:53,848 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:75, output treesize:44 [2018-04-13 06:23:53,863 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 43 treesize of output 42 [2018-04-13 06:23:53,863 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:53,880 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:53,881 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:53,881 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 42 treesize of output 43 [2018-04-13 06:23:53,882 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:53,906 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:53,906 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 28 treesize of output 31 [2018-04-13 06:23:53,906 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:53,921 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:53,922 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:53,922 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 27 treesize of output 28 [2018-04-13 06:23:53,922 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:53,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 06:23:53,933 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:72, output treesize:58 [2018-04-13 06:23:54,012 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:54,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-04-13 06:23:54,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 06:23:54,015 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:54,019 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:54,029 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:54,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-04-13 06:23:54,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 8 treesize of output 7 [2018-04-13 06:23:54,032 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:54,036 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:54,043 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 06:23:54,044 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:70, output treesize:48 [2018-04-13 06:23:54,062 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:54,066 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 71 treesize of output 75 [2018-04-13 06:23:54,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 06:23:54,068 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:54,073 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:54,087 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:54,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 43 [2018-04-13 06:23:54,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-13 06:23:54,091 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:54,095 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:54,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:23:54,107 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:110, output treesize:84 [2018-04-13 06:23:54,166 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:54,167 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 52 treesize of output 44 [2018-04-13 06:23:54,169 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 37 treesize of output 24 [2018-04-13 06:23:54,169 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:54,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-04-13 06:23:54,176 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 06:23:54,180 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 06:23:54,194 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:54,195 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 29 treesize of output 25 [2018-04-13 06:23:54,196 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 16 treesize of output 7 [2018-04-13 06:23:54,196 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:54,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-13 06:23:54,200 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:54,202 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:54,207 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 06:23:54,207 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:81, output treesize:27 [2018-04-13 06:23:54,231 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 06:23:54,232 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 06:23:54,232 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-13 06:23:54,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-13 06:23:54,232 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-13 06:23:54,232 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2018-04-13 06:23:54,233 INFO L87 Difference]: Start difference. First operand 460 states and 613 transitions. Second operand 16 states. [2018-04-13 06:23:55,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:23:55,393 INFO L93 Difference]: Finished difference Result 711 states and 935 transitions. [2018-04-13 06:23:55,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-13 06:23:55,393 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 47 [2018-04-13 06:23:55,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:23:55,394 INFO L225 Difference]: With dead ends: 711 [2018-04-13 06:23:55,394 INFO L226 Difference]: Without dead ends: 711 [2018-04-13 06:23:55,395 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=261, Invalid=731, Unknown=0, NotChecked=0, Total=992 [2018-04-13 06:23:55,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2018-04-13 06:23:55,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 460. [2018-04-13 06:23:55,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-04-13 06:23:55,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 612 transitions. [2018-04-13 06:23:55,398 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 612 transitions. Word has length 47 [2018-04-13 06:23:55,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:23:55,398 INFO L459 AbstractCegarLoop]: Abstraction has 460 states and 612 transitions. [2018-04-13 06:23:55,399 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-13 06:23:55,399 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 612 transitions. [2018-04-13 06:23:55,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-13 06:23:55,399 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:23:55,399 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:23:55,399 INFO L408 AbstractCegarLoop]: === Iteration 44 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:23:55,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1681070032, now seen corresponding path program 1 times [2018-04-13 06:23:55,399 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:23:55,399 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:23:55,400 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:55,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:23:55,400 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:55,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:23:55,404 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:23:55,405 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:23:55,405 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:23:55,405 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:23:55,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:23:55,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:23:55,420 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:23:55,453 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 06:23:55,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 06:23:55,454 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:55,456 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:55,463 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 06:23:55,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 06:23:55,465 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:55,466 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:55,472 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 06:23:55,472 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:55, output treesize:47 [2018-04-13 06:23:55,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-13 06:23:55,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-04-13 06:23:55,486 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:55,487 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:55,493 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:55,493 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:65, output treesize:50 [2018-04-13 06:23:55,518 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:55,521 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 53 treesize of output 57 [2018-04-13 06:23:55,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-13 06:23:55,522 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:55,526 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:55,532 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 06:23:55,532 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:64, output treesize:38 [2018-04-13 06:23:55,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-04-13 06:23:55,564 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 27 treesize of output 18 [2018-04-13 06:23:55,564 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:55,567 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:55,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:55,571 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:27 [2018-04-13 06:23:55,663 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~mem47.base| Int) (main_~tmp~0.base Int)) (let ((.cse0 (store |c_old(#valid)| main_~tmp~0.base 1))) (and (= 0 (select .cse0 |main_#t~mem47.base|)) (= 0 (select |c_old(#valid)| main_~tmp~0.base)) (not (= main_~tmp~0.base 0)) (= |c_#valid| (store (store .cse0 |main_#t~mem47.base| 0) main_~tmp~0.base 0))))) is different from true [2018-04-13 06:23:55,670 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-04-13 06:23:55,670 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 06:23:55,670 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-13 06:23:55,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-13 06:23:55,670 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-13 06:23:55,670 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=108, Unknown=3, NotChecked=20, Total=156 [2018-04-13 06:23:55,671 INFO L87 Difference]: Start difference. First operand 460 states and 612 transitions. Second operand 13 states. [2018-04-13 06:23:56,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:23:56,265 INFO L93 Difference]: Finished difference Result 541 states and 705 transitions. [2018-04-13 06:23:56,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-13 06:23:56,265 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48 [2018-04-13 06:23:56,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:23:56,266 INFO L225 Difference]: With dead ends: 541 [2018-04-13 06:23:56,266 INFO L226 Difference]: Without dead ends: 539 [2018-04-13 06:23:56,266 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=249, Unknown=6, NotChecked=32, Total=342 [2018-04-13 06:23:56,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2018-04-13 06:23:56,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 463. [2018-04-13 06:23:56,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2018-04-13 06:23:56,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 615 transitions. [2018-04-13 06:23:56,269 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 615 transitions. Word has length 48 [2018-04-13 06:23:56,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:23:56,269 INFO L459 AbstractCegarLoop]: Abstraction has 463 states and 615 transitions. [2018-04-13 06:23:56,269 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-13 06:23:56,270 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 615 transitions. [2018-04-13 06:23:56,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-13 06:23:56,270 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:23:56,270 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:23:56,270 INFO L408 AbstractCegarLoop]: === Iteration 45 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:23:56,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1681072013, now seen corresponding path program 1 times [2018-04-13 06:23:56,270 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:23:56,270 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:23:56,271 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:56,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:23:56,271 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:56,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:23:56,274 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:23:56,282 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 06:23:56,282 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:23:56,282 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 06:23:56,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-13 06:23:56,282 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-13 06:23:56,282 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-13 06:23:56,283 INFO L87 Difference]: Start difference. First operand 463 states and 615 transitions. Second operand 3 states. [2018-04-13 06:23:56,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:23:56,297 INFO L93 Difference]: Finished difference Result 451 states and 562 transitions. [2018-04-13 06:23:56,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-13 06:23:56,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-04-13 06:23:56,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:23:56,298 INFO L225 Difference]: With dead ends: 451 [2018-04-13 06:23:56,298 INFO L226 Difference]: Without dead ends: 426 [2018-04-13 06:23:56,299 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 06:23:56,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2018-04-13 06:23:56,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 410. [2018-04-13 06:23:56,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-04-13 06:23:56,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 537 transitions. [2018-04-13 06:23:56,303 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 537 transitions. Word has length 48 [2018-04-13 06:23:56,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:23:56,303 INFO L459 AbstractCegarLoop]: Abstraction has 410 states and 537 transitions. [2018-04-13 06:23:56,303 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-13 06:23:56,303 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 537 transitions. [2018-04-13 06:23:56,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-13 06:23:56,303 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:23:56,303 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:23:56,303 INFO L408 AbstractCegarLoop]: === Iteration 46 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:23:56,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1635249960, now seen corresponding path program 1 times [2018-04-13 06:23:56,304 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:23:56,304 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:23:56,304 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:56,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:23:56,304 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:56,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:23:56,308 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:23:56,338 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-13 06:23:56,338 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:23:56,338 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-13 06:23:56,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-13 06:23:56,338 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-13 06:23:56,338 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-13 06:23:56,339 INFO L87 Difference]: Start difference. First operand 410 states and 537 transitions. Second operand 6 states. [2018-04-13 06:23:56,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:23:56,464 INFO L93 Difference]: Finished difference Result 500 states and 658 transitions. [2018-04-13 06:23:56,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-13 06:23:56,464 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2018-04-13 06:23:56,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:23:56,465 INFO L225 Difference]: With dead ends: 500 [2018-04-13 06:23:56,465 INFO L226 Difference]: Without dead ends: 500 [2018-04-13 06:23:56,465 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-04-13 06:23:56,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2018-04-13 06:23:56,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 410. [2018-04-13 06:23:56,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-04-13 06:23:56,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 534 transitions. [2018-04-13 06:23:56,469 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 534 transitions. Word has length 48 [2018-04-13 06:23:56,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:23:56,469 INFO L459 AbstractCegarLoop]: Abstraction has 410 states and 534 transitions. [2018-04-13 06:23:56,469 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-13 06:23:56,469 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 534 transitions. [2018-04-13 06:23:56,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-13 06:23:56,470 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:23:56,470 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:23:56,470 INFO L408 AbstractCegarLoop]: === Iteration 47 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:23:56,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1629524322, now seen corresponding path program 1 times [2018-04-13 06:23:56,470 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:23:56,470 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:23:56,471 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:56,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:23:56,471 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:23:56,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:23:56,479 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:23:56,481 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:23:56,482 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:23:56,482 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:23:56,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:23:56,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:23:56,505 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:23:56,525 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-13 06:23:56,525 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:56,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:56,529 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:8 [2018-04-13 06:23:56,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-13 06:23:56,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 06:23:56,535 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:56,550 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:56,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-13 06:23:56,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 06:23:56,562 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:56,564 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:56,568 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:56,568 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-04-13 06:23:56,585 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 23 treesize of output 18 [2018-04-13 06:23:56,587 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:56,588 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 06:23:56,589 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:56,592 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:56,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-04-13 06:23:56,605 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:56,606 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 06:23:56,606 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:56,609 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:56,617 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 06:23:56,617 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:60, output treesize:40 [2018-04-13 06:23:56,675 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 51 treesize of output 65 [2018-04-13 06:23:56,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 51 [2018-04-13 06:23:56,678 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:56,700 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:56,721 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 55 [2018-04-13 06:23:56,723 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 53 treesize of output 52 [2018-04-13 06:23:56,723 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:56,735 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:56,746 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:23:56,746 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:104, output treesize:71 [2018-04-13 06:23:56,768 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:56,768 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:56,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-13 06:23:56,769 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:56,779 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 06:23:56,779 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:80, output treesize:74 [2018-04-13 06:23:56,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 59 [2018-04-13 06:23:56,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 50 [2018-04-13 06:23:56,838 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:56,858 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 38 treesize of output 43 [2018-04-13 06:23:56,859 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-13 06:23:56,871 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 06:23:56,894 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 39 treesize of output 40 [2018-04-13 06:23:56,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 06:23:56,896 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:56,901 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:56,920 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-13 06:23:56,920 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:96, output treesize:139 [2018-04-13 06:23:57,045 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 3 case distinctions, treesize of input 120 treesize of output 134 [2018-04-13 06:23:57,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 121 treesize of output 120 [2018-04-13 06:23:57,048 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:57,096 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:57,098 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:23:57,108 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 4 case distinctions, treesize of input 114 treesize of output 145 [2018-04-13 06:23:57,108 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-04-13 06:23:57,173 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-13 06:23:57,259 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:57,260 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 115 treesize of output 88 [2018-04-13 06:23:57,262 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:57,262 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:57,263 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:57,263 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:57,263 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 62 treesize of output 75 [2018-04-13 06:23:57,264 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:57,277 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:57,279 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:57,279 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 115 treesize of output 88 [2018-04-13 06:23:57,281 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:57,281 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:57,282 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:57,282 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:57,282 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 62 treesize of output 91 [2018-04-13 06:23:57,283 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:57,296 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:57,307 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 110 treesize of output 105 [2018-04-13 06:23:57,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 114 [2018-04-13 06:23:57,315 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-04-13 06:23:57,383 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:57,383 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:57,384 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:57,386 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:57,397 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 6 case distinctions, treesize of input 88 treesize of output 121 [2018-04-13 06:23:57,398 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 8 xjuncts. [2018-04-13 06:23:57,523 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-13 06:23:57,631 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 119 treesize of output 113 [2018-04-13 06:23:57,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-13 06:23:57,632 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:57,645 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:57,732 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 109 treesize of output 100 [2018-04-13 06:23:57,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 06:23:57,734 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:57,746 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:57,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-2 vars, End of recursive call: 6 dim-0 vars, and 5 xjuncts. [2018-04-13 06:23:57,821 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 10 variables, input treesize:240, output treesize:410 [2018-04-13 06:23:58,096 WARN L151 SmtUtils]: Spent 134ms on a formula simplification. DAG size of input: 87 DAG size of output 87 [2018-04-13 06:23:58,265 WARN L151 SmtUtils]: Spent 136ms on a formula simplification. DAG size of input: 91 DAG size of output 90 [2018-04-13 06:23:58,577 WARN L151 SmtUtils]: Spent 274ms on a formula simplification. DAG size of input: 96 DAG size of output 93 [2018-04-13 06:23:58,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 114 [2018-04-13 06:23:58,659 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 06:23:58,659 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:58,674 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:58,674 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 55 [2018-04-13 06:23:58,675 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 06:23:58,687 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 06:23:58,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 92 [2018-04-13 06:23:58,731 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:58,731 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:23:58,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 29 treesize of output 18 [2018-04-13 06:23:58,731 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:58,742 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:58,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 54 [2018-04-13 06:23:58,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-13 06:23:58,783 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:58,790 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:58,791 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:23:58,791 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 29 treesize of output 18 [2018-04-13 06:23:58,791 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:58,797 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:58,830 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:58,831 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 119 treesize of output 102 [2018-04-13 06:23:58,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 21 [2018-04-13 06:23:58,835 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-04-13 06:23:58,851 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:58,851 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2018-04-13 06:23:58,852 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:58,853 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:58,853 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:58,854 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:58,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 35 [2018-04-13 06:23:58,856 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:58,869 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:58,897 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:58,897 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:58,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 67 [2018-04-13 06:23:58,902 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 23 [2018-04-13 06:23:58,902 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:58,910 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:58,911 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:58,911 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:58,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2018-04-13 06:23:58,913 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:58,919 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:58,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2018-04-13 06:23:58,941 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:23:58,941 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:23:58,941 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 29 treesize of output 18 [2018-04-13 06:23:58,941 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-13 06:23:58,946 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:58,963 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:23:58,963 INFO L202 ElimStorePlain]: Needed 18 recursive calls to eliminate 13 variables, input treesize:351, output treesize:13 [2018-04-13 06:23:59,021 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 06:23:59,022 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 06:23:59,022 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-13 06:23:59,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-13 06:23:59,022 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-13 06:23:59,022 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2018-04-13 06:23:59,022 INFO L87 Difference]: Start difference. First operand 410 states and 534 transitions. Second operand 21 states. [2018-04-13 06:24:05,939 WARN L148 SmtUtils]: Spent 157ms on a formula simplification that was a NOOP. DAG size: 163 [2018-04-13 06:24:08,348 WARN L148 SmtUtils]: Spent 266ms on a formula simplification that was a NOOP. DAG size: 166 [2018-04-13 06:24:08,829 WARN L151 SmtUtils]: Spent 405ms on a formula simplification. DAG size of input: 177 DAG size of output 169 [2018-04-13 06:24:09,199 WARN L151 SmtUtils]: Spent 334ms on a formula simplification. DAG size of input: 173 DAG size of output 152 [2018-04-13 06:24:09,588 WARN L151 SmtUtils]: Spent 353ms on a formula simplification. DAG size of input: 178 DAG size of output 157 [2018-04-13 06:24:09,782 WARN L148 SmtUtils]: Spent 138ms on a formula simplification that was a NOOP. DAG size: 148 [2018-04-13 06:24:10,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:24:10,347 INFO L93 Difference]: Finished difference Result 516 states and 631 transitions. [2018-04-13 06:24:10,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-13 06:24:10,347 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 48 [2018-04-13 06:24:10,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:24:10,348 INFO L225 Difference]: With dead ends: 516 [2018-04-13 06:24:10,348 INFO L226 Difference]: Without dead ends: 516 [2018-04-13 06:24:10,348 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=300, Invalid=1334, Unknown=6, NotChecked=0, Total=1640 [2018-04-13 06:24:10,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2018-04-13 06:24:10,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 448. [2018-04-13 06:24:10,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2018-04-13 06:24:10,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 578 transitions. [2018-04-13 06:24:10,351 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 578 transitions. Word has length 48 [2018-04-13 06:24:10,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:24:10,351 INFO L459 AbstractCegarLoop]: Abstraction has 448 states and 578 transitions. [2018-04-13 06:24:10,351 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-13 06:24:10,351 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 578 transitions. [2018-04-13 06:24:10,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-13 06:24:10,351 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:24:10,352 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:24:10,352 INFO L408 AbstractCegarLoop]: === Iteration 48 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:24:10,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1806446818, now seen corresponding path program 1 times [2018-04-13 06:24:10,352 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:24:10,352 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:24:10,352 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:24:10,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:24:10,352 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:24:10,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:24:10,358 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:24:10,359 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:24:10,360 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:24:10,360 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:24:10,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:24:10,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:24:10,387 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:24:10,397 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 06:24:10,397 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:24:10,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:24:10,401 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2018-04-13 06:24:10,418 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 06:24:10,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 06:24:10,419 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:24:10,421 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:24:10,429 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 06:24:10,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 06:24:10,430 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:24:10,431 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:24:10,437 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 06:24:10,438 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2018-04-13 06:24:10,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-13 06:24:10,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-04-13 06:24:10,448 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:24:10,449 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:24:10,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:24:10,453 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:23 [2018-04-13 06:24:10,472 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 35 [2018-04-13 06:24:10,474 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:24:10,474 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 21 treesize of output 28 [2018-04-13 06:24:10,475 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:24:10,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-13 06:24:10,485 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:24:10,490 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:24:10,494 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 06:24:10,494 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:34, output treesize:20 [2018-04-13 06:24:10,532 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:24:10,533 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:24:10,534 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:24:10,534 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 45 [2018-04-13 06:24:10,535 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:24:10,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:24:10,542 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:45 [2018-04-13 06:24:10,573 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 33 treesize of output 26 [2018-04-13 06:24:10,575 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:24:10,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2018-04-13 06:24:10,576 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:24:10,580 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:24:10,587 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 06:24:10,587 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:49 [2018-04-13 06:24:10,607 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 40 treesize of output 41 [2018-04-13 06:24:10,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 06:24:10,608 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:24:10,613 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:24:10,622 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 06:24:10,622 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:60, output treesize:56 [2018-04-13 06:24:10,645 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 49 treesize of output 48 [2018-04-13 06:24:10,647 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:24:10,648 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 06:24:10,648 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:24:10,654 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:24:10,664 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 06:24:10,664 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:65 [2018-04-13 06:24:10,689 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:24:10,690 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:24:10,690 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:24:10,692 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:24:10,692 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 33 treesize of output 72 [2018-04-13 06:24:10,692 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:24:10,709 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 06:24:10,709 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:79, output treesize:95 [2018-04-13 06:24:10,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 74 [2018-04-13 06:24:10,747 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:24:10,748 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:24:10,748 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:24:10,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-04-13 06:24:10,750 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:24:10,761 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:24:10,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 14 [2018-04-13 06:24:10,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-13 06:24:10,784 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:24:10,785 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:24:10,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:24:10,804 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:121, output treesize:129 [2018-04-13 06:24:10,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2018-04-13 06:24:10,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-04-13 06:24:10,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:24:10,841 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:24:10,855 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 06:24:10,856 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:171, output treesize:148 [2018-04-13 06:24:10,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 145 treesize of output 131 [2018-04-13 06:24:10,927 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:24:10,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 125 treesize of output 131 [2018-04-13 06:24:10,935 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-13 06:24:11,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 141 [2018-04-13 06:24:11,096 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:24:11,286 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:24:11,286 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:24:11,287 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:24:11,304 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 1 new quantified variables, introduced 6 case distinctions, treesize of input 113 treesize of output 145 [2018-04-13 06:24:11,305 INFO L267 ElimStorePlain]: Start of recursive call 5: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 8 xjuncts. [2018-04-13 06:24:11,450 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:24:11,570 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: 3 dim-0 vars, and 7 xjuncts. [2018-04-13 06:24:11,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 20 dim-0 vars, and 7 xjuncts. [2018-04-13 06:24:11,700 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:159, output treesize:939 [2018-04-13 06:24:49,429 WARN L151 SmtUtils]: Spent 33648ms on a formula simplification. DAG size of input: 235 DAG size of output 132 [2018-04-13 06:24:49,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 176 [2018-04-13 06:24:49,448 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:24:49,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 155 [2018-04-13 06:24:49,541 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:24:49,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 143 [2018-04-13 06:24:49,638 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:24:49,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, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 142 [2018-04-13 06:24:49,727 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:24:49,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 13 dim-0 vars, 4 dim-1 vars, End of recursive call: 13 dim-0 vars, and 4 xjuncts. [2018-04-13 06:24:49,817 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 17 variables, input treesize:511, output treesize:507 [2018-04-13 06:24:51,964 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 135 treesize of output 94 [2018-04-13 06:24:51,965 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:24:51,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 30 [2018-04-13 06:24:51,992 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:24:52,004 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 31 [2018-04-13 06:24:52,004 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 06:24:52,014 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 06:24:52,073 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 135 treesize of output 94 [2018-04-13 06:24:52,074 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:24:52,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 30 [2018-04-13 06:24:52,075 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:24:52,086 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 31 [2018-04-13 06:24:52,087 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:24:52,097 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 06:24:52,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 85 [2018-04-13 06:24:52,163 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 31 [2018-04-13 06:24:52,163 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:24:52,178 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:24:52,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-04-13 06:24:52,178 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-13 06:24:52,188 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:24:52,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 84 [2018-04-13 06:24:52,239 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:24:52,239 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:24:52,240 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:24:52,241 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 40 [2018-04-13 06:24:52,241 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:24:52,253 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 25 treesize of output 14 [2018-04-13 06:24:52,253 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-13 06:24:52,260 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:24:52,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 13 dim-0 vars, 4 dim-2 vars, End of recursive call: 12 dim-0 vars, and 4 xjuncts. [2018-04-13 06:24:52,301 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 17 variables, input treesize:479, output treesize:165 [2018-04-13 06:24:52,345 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 06:24:52,345 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:24:52,346 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-04-13 06:24:52,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-13 06:24:52,346 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-13 06:24:52,346 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=287, Unknown=2, NotChecked=0, Total=380 [2018-04-13 06:24:52,346 INFO L87 Difference]: Start difference. First operand 448 states and 578 transitions. Second operand 20 states. [2018-04-13 06:25:32,891 WARN L151 SmtUtils]: Spent 32314ms on a formula simplification. DAG size of input: 160 DAG size of output 160 [2018-04-13 06:26:04,348 WARN L151 SmtUtils]: Spent 31377ms on a formula simplification. DAG size of input: 184 DAG size of output 163 [2018-04-13 06:26:04,547 WARN L148 SmtUtils]: Spent 122ms on a formula simplification that was a NOOP. DAG size: 40 [2018-04-13 06:26:36,070 WARN L151 SmtUtils]: Spent 27023ms on a formula simplification. DAG size of input: 153 DAG size of output 153 [2018-04-13 06:27:10,253 WARN L151 SmtUtils]: Spent 30050ms on a formula simplification. DAG size of input: 144 DAG size of output 144 [2018-04-13 06:27:47,946 WARN L151 SmtUtils]: Spent 32978ms on a formula simplification. DAG size of input: 146 DAG size of output 146 [2018-04-13 06:27:48,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:27:48,091 INFO L93 Difference]: Finished difference Result 842 states and 1057 transitions. [2018-04-13 06:27:48,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-13 06:27:48,091 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 49 [2018-04-13 06:27:48,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:27:48,092 INFO L225 Difference]: With dead ends: 842 [2018-04-13 06:27:48,092 INFO L226 Difference]: Without dead ends: 842 [2018-04-13 06:27:48,092 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 213.8s TimeCoverageRelationStatistics Valid=437, Invalid=1112, Unknown=11, NotChecked=0, Total=1560 [2018-04-13 06:27:48,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2018-04-13 06:27:48,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 507. [2018-04-13 06:27:48,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2018-04-13 06:27:48,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 662 transitions. [2018-04-13 06:27:48,096 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 662 transitions. Word has length 49 [2018-04-13 06:27:48,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:27:48,096 INFO L459 AbstractCegarLoop]: Abstraction has 507 states and 662 transitions. [2018-04-13 06:27:48,096 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-13 06:27:48,096 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 662 transitions. [2018-04-13 06:27:48,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-13 06:27:48,097 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:27:48,097 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:27:48,097 INFO L408 AbstractCegarLoop]: === Iteration 49 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:27:48,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1806446819, now seen corresponding path program 1 times [2018-04-13 06:27:48,097 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:27:48,097 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:27:48,097 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:27:48,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:27:48,098 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:27:48,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:27:48,103 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:27:48,107 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:27:48,107 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:27:48,107 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:27:48,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:27:48,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:27:48,167 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:27:48,176 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 06:27:48,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 06:27:48,178 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:27:48,180 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:27:48,185 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:27:48,185 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:16 [2018-04-13 06:27:48,195 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 06:27:48,197 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:48,198 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 06:27:48,198 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:27:48,202 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:27:48,208 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:27:48,208 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-04-13 06:27:48,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 06:27:48,218 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:27:48,229 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 11 [2018-04-13 06:27:48,229 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:27:48,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:27:48,237 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:42 [2018-04-13 06:27:48,253 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 06:27:48,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 06:27:48,254 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:27:48,256 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:27:48,270 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 06:27:48,272 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:48,272 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:48,273 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:48,273 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 06:27:48,273 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:27:48,279 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:27:48,290 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 06:27:48,290 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:65, output treesize:66 [2018-04-13 06:27:48,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 63 [2018-04-13 06:27:48,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 49 [2018-04-13 06:27:48,380 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:27:48,411 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:48,412 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:48,413 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:48,413 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:48,414 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:27:48,417 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 43 treesize of output 91 [2018-04-13 06:27:48,417 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:27:48,435 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 06:27:48,468 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 113 treesize of output 110 [2018-04-13 06:27:48,470 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:48,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 112 [2018-04-13 06:27:48,471 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 06:27:48,501 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 104 treesize of output 103 [2018-04-13 06:27:48,502 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 06:27:48,518 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:27:48,522 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 127 treesize of output 94 [2018-04-13 06:27:48,524 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:48,524 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 94 treesize of output 117 [2018-04-13 06:27:48,524 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-13 06:27:48,534 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:27:48,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 06:27:48,561 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:134, output treesize:200 [2018-04-13 06:27:48,993 WARN L151 SmtUtils]: Spent 155ms on a formula simplification. DAG size of input: 68 DAG size of output 66 [2018-04-13 06:27:49,045 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:49,046 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:49,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 52 [2018-04-13 06:27:49,047 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:27:49,082 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:49,083 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:49,083 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:49,084 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:49,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 55 [2018-04-13 06:27:49,085 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:27:49,109 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 06:27:49,110 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:137, output treesize:134 [2018-04-13 06:27:49,212 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 37 treesize of output 28 [2018-04-13 06:27:49,215 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:49,215 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:49,216 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:49,216 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:49,216 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:27:49,219 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 28 treesize of output 64 [2018-04-13 06:27:49,219 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:27:49,227 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:27:49,253 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:49,254 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:49,255 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:49,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 83 treesize of output 92 [2018-04-13 06:27:49,266 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:49,276 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 97 treesize of output 145 [2018-04-13 06:27:49,277 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-13 06:27:49,303 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:27:49,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 06:27:49,326 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:153, output treesize:131 [2018-04-13 06:27:49,368 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 42 [2018-04-13 06:27:49,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 06:27:49,370 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:27:49,377 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:27:49,407 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:49,408 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:49,409 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:49,412 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:49,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 139 [2018-04-13 06:27:49,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 24 treesize of output 26 [2018-04-13 06:27:49,415 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:27:49,429 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:27:49,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 06:27:49,455 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:156, output treesize:160 [2018-04-13 06:27:49,511 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 65 treesize of output 71 [2018-04-13 06:27:49,513 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:49,513 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 24 treesize of output 39 [2018-04-13 06:27:49,513 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:27:49,524 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:27:49,562 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:49,563 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:49,564 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:49,566 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:49,567 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:49,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 171 [2018-04-13 06:27:49,573 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:49,580 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 72 [2018-04-13 06:27:49,581 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-13 06:27:49,605 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:27:49,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 06:27:49,637 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:186, output treesize:182 [2018-04-13 06:27:49,699 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:49,700 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:49,701 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:49,702 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:49,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 81 [2018-04-13 06:27:49,702 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:27:49,764 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:49,765 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:49,766 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:49,766 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:49,767 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:49,767 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:49,768 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 0 case distinctions, treesize of input 33 treesize of output 79 [2018-04-13 06:27:49,768 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:27:49,815 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 06:27:49,815 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:202, output treesize:217 [2018-04-13 06:27:49,883 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:49,884 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:49,885 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:49,887 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:49,887 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:49,888 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:49,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 217 [2018-04-13 06:27:49,894 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:49,894 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:49,897 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:49,908 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 67 treesize of output 107 [2018-04-13 06:27:49,909 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-13 06:27:49,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:27:49,999 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:50,004 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 78 treesize of output 78 [2018-04-13 06:27:50,006 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:50,007 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:50,007 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:50,008 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 31 treesize of output 70 [2018-04-13 06:27:50,008 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:27:50,019 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:27:50,061 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 06:27:50,061 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:240, output treesize:247 [2018-04-13 06:27:50,191 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:50,192 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:50,193 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:50,193 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:50,194 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:50,196 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:50,198 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:50,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 322 treesize of output 356 [2018-04-13 06:27:50,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-04-13 06:27:50,205 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:27:50,254 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:27:50,303 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:50,304 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:50,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 254 treesize of output 270 [2018-04-13 06:27:50,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-04-13 06:27:50,311 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:27:50,337 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:27:50,380 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 06:27:50,380 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:371, output treesize:293 [2018-04-13 06:27:50,451 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:50,452 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:50,452 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:50,453 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:50,454 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:50,455 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:50,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 180 [2018-04-13 06:27:50,455 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:27:50,510 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:50,511 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:50,512 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:50,512 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:50,513 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:50,513 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:50,514 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:50,515 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:50,515 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:50,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 137 [2018-04-13 06:27:50,516 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:27:50,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-13 06:27:50,562 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:304, output treesize:286 [2018-04-13 06:27:50,645 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:50,645 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:50,646 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:50,646 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:50,647 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:50,648 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:50,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 226 treesize of output 199 [2018-04-13 06:27:50,660 INFO L477 Elim1Store]: Elim1 applied some 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 41 [2018-04-13 06:27:50,661 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:27:50,687 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:50,687 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:50,688 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:50,689 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 64 [2018-04-13 06:27:50,690 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 06:27:50,710 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:50,710 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:50,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 83 [2018-04-13 06:27:50,711 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:27:50,727 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 06:27:50,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 55 [2018-04-13 06:27:50,760 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:50,760 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:50,761 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:50,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 33 [2018-04-13 06:27:50,761 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 06:27:50,770 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:50,770 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:27:50,771 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:27:50,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 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 18 [2018-04-13 06:27:50,771 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-13 06:27:50,775 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:27:50,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-13 06:27:50,795 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:279, output treesize:45 [2018-04-13 06:27:50,853 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 06:27:50,853 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:27:50,853 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2018-04-13 06:27:50,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-13 06:27:50,853 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-13 06:27:50,853 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=503, Unknown=5, NotChecked=0, Total=650 [2018-04-13 06:27:50,853 INFO L87 Difference]: Start difference. First operand 507 states and 662 transitions. Second operand 26 states. [2018-04-13 06:27:51,548 WARN L151 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 74 DAG size of output 71 [2018-04-13 06:27:54,486 WARN L151 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 124 DAG size of output 99 [2018-04-13 06:27:54,905 WARN L151 SmtUtils]: Spent 237ms on a formula simplification. DAG size of input: 130 DAG size of output 102 [2018-04-13 06:27:55,673 WARN L151 SmtUtils]: Spent 126ms on a formula simplification. DAG size of input: 129 DAG size of output 98 [2018-04-13 06:28:01,961 WARN L151 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 111 DAG size of output 87 [2018-04-13 06:28:03,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:28:03,849 INFO L93 Difference]: Finished difference Result 913 states and 1127 transitions. [2018-04-13 06:28:03,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-04-13 06:28:03,849 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 49 [2018-04-13 06:28:03,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:28:03,850 INFO L225 Difference]: With dead ends: 913 [2018-04-13 06:28:03,850 INFO L226 Difference]: Without dead ends: 913 [2018-04-13 06:28:03,851 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1096 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=980, Invalid=3550, Unknown=26, NotChecked=0, Total=4556 [2018-04-13 06:28:03,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2018-04-13 06:28:03,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 602. [2018-04-13 06:28:03,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-04-13 06:28:03,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 797 transitions. [2018-04-13 06:28:03,855 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 797 transitions. Word has length 49 [2018-04-13 06:28:03,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:28:03,856 INFO L459 AbstractCegarLoop]: Abstraction has 602 states and 797 transitions. [2018-04-13 06:28:03,856 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-13 06:28:03,856 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 797 transitions. [2018-04-13 06:28:03,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-13 06:28:03,856 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:28:03,856 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 06:28:03,856 INFO L408 AbstractCegarLoop]: === Iteration 50 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:28:03,856 INFO L82 PathProgramCache]: Analyzing trace with hash -8372055, now seen corresponding path program 1 times [2018-04-13 06:28:03,856 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:28:03,856 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:28:03,857 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:28:03,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:28:03,857 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:28:03,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:28:03,861 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:28:03,863 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:28:03,863 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:28:03,863 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:28:03,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:28:03,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:28:03,875 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:28:03,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 06:28:03,877 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:03,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:03,879 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 06:28:03,886 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 06:28:03,886 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:03,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:03,888 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2018-04-13 06:28:03,899 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:03,900 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 14 treesize of output 17 [2018-04-13 06:28:03,900 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:03,907 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:03,907 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:03,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 06:28:03,908 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:03,912 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 06:28:03,912 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:23 [2018-04-13 06:28:03,938 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:03,939 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:03,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 19 treesize of output 37 [2018-04-13 06:28:03,947 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-13 06:28:03,969 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 06:28:03,970 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:03,984 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-13 06:28:03,985 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:73 [2018-04-13 06:28:04,053 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 06:28:04,053 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 06:28:04,053 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-04-13 06:28:04,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-13 06:28:04,053 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-13 06:28:04,053 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-04-13 06:28:04,053 INFO L87 Difference]: Start difference. First operand 602 states and 797 transitions. Second operand 9 states. [2018-04-13 06:28:04,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:28:04,935 INFO L93 Difference]: Finished difference Result 963 states and 1207 transitions. [2018-04-13 06:28:04,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-13 06:28:04,935 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2018-04-13 06:28:04,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:28:04,936 INFO L225 Difference]: With dead ends: 963 [2018-04-13 06:28:04,936 INFO L226 Difference]: Without dead ends: 963 [2018-04-13 06:28:04,936 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2018-04-13 06:28:04,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2018-04-13 06:28:04,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 639. [2018-04-13 06:28:04,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2018-04-13 06:28:04,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 846 transitions. [2018-04-13 06:28:04,941 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 846 transitions. Word has length 50 [2018-04-13 06:28:04,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:28:04,941 INFO L459 AbstractCegarLoop]: Abstraction has 639 states and 846 transitions. [2018-04-13 06:28:04,941 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-13 06:28:04,941 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 846 transitions. [2018-04-13 06:28:04,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-13 06:28:04,941 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:28:04,941 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:28:04,941 INFO L408 AbstractCegarLoop]: === Iteration 51 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:28:04,942 INFO L82 PathProgramCache]: Analyzing trace with hash 165276669, now seen corresponding path program 1 times [2018-04-13 06:28:04,942 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:28:04,942 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:28:04,942 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:28:04,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:28:04,942 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:28:04,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:28:04,946 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:28:04,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 06:28:04,955 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:28:04,955 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 06:28:04,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 06:28:04,956 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 06:28:04,956 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 06:28:04,956 INFO L87 Difference]: Start difference. First operand 639 states and 846 transitions. Second operand 4 states. [2018-04-13 06:28:05,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:28:05,096 INFO L93 Difference]: Finished difference Result 1095 states and 1457 transitions. [2018-04-13 06:28:05,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 06:28:05,096 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-04-13 06:28:05,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:28:05,098 INFO L225 Difference]: With dead ends: 1095 [2018-04-13 06:28:05,098 INFO L226 Difference]: Without dead ends: 1095 [2018-04-13 06:28:05,098 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 06:28:05,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2018-04-13 06:28:05,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 638. [2018-04-13 06:28:05,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2018-04-13 06:28:05,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 845 transitions. [2018-04-13 06:28:05,103 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 845 transitions. Word has length 50 [2018-04-13 06:28:05,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:28:05,103 INFO L459 AbstractCegarLoop]: Abstraction has 638 states and 845 transitions. [2018-04-13 06:28:05,103 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 06:28:05,103 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 845 transitions. [2018-04-13 06:28:05,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-13 06:28:05,104 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:28:05,104 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:28:05,104 INFO L408 AbstractCegarLoop]: === Iteration 52 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:28:05,104 INFO L82 PathProgramCache]: Analyzing trace with hash 165276670, now seen corresponding path program 1 times [2018-04-13 06:28:05,104 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:28:05,104 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:28:05,105 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:28:05,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:28:05,105 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:28:05,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:28:05,112 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:28:05,132 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 06:28:05,132 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:28:05,132 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 06:28:05,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 06:28:05,133 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 06:28:05,133 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 06:28:05,133 INFO L87 Difference]: Start difference. First operand 638 states and 845 transitions. Second operand 4 states. [2018-04-13 06:28:05,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:28:05,329 INFO L93 Difference]: Finished difference Result 904 states and 1163 transitions. [2018-04-13 06:28:05,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-13 06:28:05,329 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-04-13 06:28:05,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:28:05,331 INFO L225 Difference]: With dead ends: 904 [2018-04-13 06:28:05,331 INFO L226 Difference]: Without dead ends: 904 [2018-04-13 06:28:05,331 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 06:28:05,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2018-04-13 06:28:05,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 637. [2018-04-13 06:28:05,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 637 states. [2018-04-13 06:28:05,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 844 transitions. [2018-04-13 06:28:05,337 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 844 transitions. Word has length 50 [2018-04-13 06:28:05,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:28:05,337 INFO L459 AbstractCegarLoop]: Abstraction has 637 states and 844 transitions. [2018-04-13 06:28:05,337 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 06:28:05,337 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 844 transitions. [2018-04-13 06:28:05,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-13 06:28:05,337 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:28:05,338 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:28:05,338 INFO L408 AbstractCegarLoop]: === Iteration 53 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:28:05,338 INFO L82 PathProgramCache]: Analyzing trace with hash -426931142, now seen corresponding path program 1 times [2018-04-13 06:28:05,338 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:28:05,338 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:28:05,338 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:28:05,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:28:05,338 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:28:05,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:28:05,344 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:28:05,346 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:28:05,346 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:28:05,346 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:28:05,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:28:05,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:28:05,376 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:28:05,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 06:28:05,380 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:05,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:05,384 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 06:28:05,393 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:05,394 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:05,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 06:28:05,394 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:05,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:05,398 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-13 06:28:05,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-13 06:28:05,406 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 06:28:05,406 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:05,408 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:05,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-13 06:28:05,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 06:28:05,417 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:05,418 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:05,424 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 06:28:05,424 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:42, output treesize:28 [2018-04-13 06:28:05,451 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 22 treesize of output 34 [2018-04-13 06:28:05,453 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:05,454 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 20 treesize of output 27 [2018-04-13 06:28:05,455 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:05,466 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2018-04-13 06:28:05,467 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:05,471 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:05,490 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 30 treesize of output 40 [2018-04-13 06:28:05,492 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:05,493 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 26 treesize of output 35 [2018-04-13 06:28:05,493 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:05,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-04-13 06:28:05,508 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:05,514 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:05,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:05,521 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:59, output treesize:28 [2018-04-13 06:28:05,523 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:05,524 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:05,524 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 06:28:05,525 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:05,528 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:05,528 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:27 [2018-04-13 06:28:05,568 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 30 treesize of output 31 [2018-04-13 06:28:05,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 06:28:05,570 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:05,573 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:05,583 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 22 treesize of output 23 [2018-04-13 06:28:05,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 06:28:05,585 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:05,588 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:05,595 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:05,595 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:58, output treesize:32 [2018-04-13 06:28:05,607 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-04-13 06:28:05,607 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-04-13 06:28:05,608 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:05,608 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:05,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:05,612 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:26 [2018-04-13 06:28:05,626 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 30 treesize of output 31 [2018-04-13 06:28:05,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 06:28:05,627 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:05,631 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:05,636 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 06:28:05,636 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:22 [2018-04-13 06:28:05,658 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 28 treesize of output 22 [2018-04-13 06:28:05,659 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 7 [2018-04-13 06:28:05,659 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:05,661 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:05,664 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 06:28:05,664 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:7 [2018-04-13 06:28:05,677 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 06:28:05,678 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 06:28:05,678 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-13 06:28:05,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-13 06:28:05,678 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-13 06:28:05,678 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-04-13 06:28:05,678 INFO L87 Difference]: Start difference. First operand 637 states and 844 transitions. Second operand 16 states. [2018-04-13 06:28:06,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:28:06,568 INFO L93 Difference]: Finished difference Result 1076 states and 1349 transitions. [2018-04-13 06:28:06,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-13 06:28:06,568 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 50 [2018-04-13 06:28:06,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:28:06,570 INFO L225 Difference]: With dead ends: 1076 [2018-04-13 06:28:06,570 INFO L226 Difference]: Without dead ends: 1076 [2018-04-13 06:28:06,570 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=294, Invalid=1266, Unknown=0, NotChecked=0, Total=1560 [2018-04-13 06:28:06,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2018-04-13 06:28:06,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 695. [2018-04-13 06:28:06,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 695 states. [2018-04-13 06:28:06,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 934 transitions. [2018-04-13 06:28:06,579 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 934 transitions. Word has length 50 [2018-04-13 06:28:06,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:28:06,579 INFO L459 AbstractCegarLoop]: Abstraction has 695 states and 934 transitions. [2018-04-13 06:28:06,579 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-13 06:28:06,579 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 934 transitions. [2018-04-13 06:28:06,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-13 06:28:06,579 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:28:06,580 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:28:06,580 INFO L408 AbstractCegarLoop]: === Iteration 54 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:28:06,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1451295616, now seen corresponding path program 1 times [2018-04-13 06:28:06,580 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:28:06,580 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:28:06,581 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:28:06,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:28:06,581 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:28:06,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:28:06,587 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:28:06,653 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 06:28:06,654 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:28:06,654 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-13 06:28:06,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-13 06:28:06,654 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-13 06:28:06,654 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-04-13 06:28:06,654 INFO L87 Difference]: Start difference. First operand 695 states and 934 transitions. Second operand 7 states. [2018-04-13 06:28:06,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:28:06,889 INFO L93 Difference]: Finished difference Result 725 states and 957 transitions. [2018-04-13 06:28:06,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-13 06:28:06,889 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2018-04-13 06:28:06,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:28:06,890 INFO L225 Difference]: With dead ends: 725 [2018-04-13 06:28:06,890 INFO L226 Difference]: Without dead ends: 725 [2018-04-13 06:28:06,890 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-04-13 06:28:06,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2018-04-13 06:28:06,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 630. [2018-04-13 06:28:06,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2018-04-13 06:28:06,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 834 transitions. [2018-04-13 06:28:06,899 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 834 transitions. Word has length 51 [2018-04-13 06:28:06,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:28:06,899 INFO L459 AbstractCegarLoop]: Abstraction has 630 states and 834 transitions. [2018-04-13 06:28:06,900 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-13 06:28:06,900 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 834 transitions. [2018-04-13 06:28:06,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-13 06:28:06,900 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:28:06,900 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:28:06,900 INFO L408 AbstractCegarLoop]: === Iteration 55 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:28:06,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1555912094, now seen corresponding path program 1 times [2018-04-13 06:28:06,901 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:28:06,901 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:28:06,901 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:28:06,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:28:06,901 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:28:06,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:28:06,912 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:28:06,914 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:28:06,914 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:28:06,916 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:28:06,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:28:06,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:28:06,963 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:28:06,976 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:06,977 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:06,977 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 06:28:06,978 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:06,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:06,986 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-04-13 06:28:07,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-13 06:28:07,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 06:28:07,003 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:07,005 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:07,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-13 06:28:07,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 06:28:07,021 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:07,023 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:07,034 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 06:28:07,034 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:39 [2018-04-13 06:28:07,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-13 06:28:07,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-04-13 06:28:07,048 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:07,049 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:07,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:07,054 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:48, output treesize:33 [2018-04-13 06:28:07,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 43 [2018-04-13 06:28:07,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-04-13 06:28:07,080 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:07,099 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:07,105 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 06:28:07,106 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:30 [2018-04-13 06:28:07,141 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:07,141 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:07,142 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:07,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 55 [2018-04-13 06:28:07,143 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:07,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:07,154 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:55 [2018-04-13 06:28:07,194 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 45 treesize of output 36 [2018-04-13 06:28:07,196 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:07,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2018-04-13 06:28:07,196 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:07,202 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:07,211 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 06:28:07,211 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:61 [2018-04-13 06:28:07,235 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 52 treesize of output 53 [2018-04-13 06:28:07,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 06:28:07,236 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:07,242 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:07,252 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 06:28:07,252 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:72, output treesize:68 [2018-04-13 06:28:07,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 60 [2018-04-13 06:28:07,279 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:07,280 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 06:28:07,280 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:07,288 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:07,300 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 06:28:07,300 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:81, output treesize:77 [2018-04-13 06:28:07,330 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:07,331 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:07,332 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:07,332 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:07,333 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 33 treesize of output 81 [2018-04-13 06:28:07,333 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:07,352 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 06:28:07,353 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:88, output treesize:106 [2018-04-13 06:28:07,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 88 [2018-04-13 06:28:07,393 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:07,394 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:07,394 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:07,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-04-13 06:28:07,396 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:07,418 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:07,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:28:07,438 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:119, output treesize:130 [2018-04-13 06:28:07,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 199 treesize of output 154 [2018-04-13 06:28:07,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-13 06:28:07,521 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:07,536 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:07,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 06:28:07,555 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:210, output treesize:175 [2018-04-13 06:28:11,622 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 51 treesize of output 146 [2018-04-13 06:28:11,622 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:11,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-13 06:28:11,643 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:181, output treesize:180 [2018-04-13 06:28:15,694 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 173 treesize of output 114 [2018-04-13 06:28:15,696 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:15,696 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:15,697 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:15,698 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2018-04-13 06:28:15,699 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:28:15,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 39 [2018-04-13 06:28:15,713 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 06:28:15,723 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 06:28:15,734 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-13 06:28:15,735 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:184, output treesize:45 [2018-04-13 06:28:15,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 06:28:15,835 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:28:15,835 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-04-13 06:28:15,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-13 06:28:15,835 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-13 06:28:15,835 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=287, Unknown=2, NotChecked=0, Total=380 [2018-04-13 06:28:15,835 INFO L87 Difference]: Start difference. First operand 630 states and 834 transitions. Second operand 20 states. [2018-04-13 06:28:47,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:28:47,070 INFO L93 Difference]: Finished difference Result 1110 states and 1429 transitions. [2018-04-13 06:28:47,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-13 06:28:47,070 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 53 [2018-04-13 06:28:47,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:28:47,072 INFO L225 Difference]: With dead ends: 1110 [2018-04-13 06:28:47,072 INFO L226 Difference]: Without dead ends: 1110 [2018-04-13 06:28:47,072 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 37.6s TimeCoverageRelationStatistics Valid=515, Invalid=1275, Unknown=16, NotChecked=0, Total=1806 [2018-04-13 06:28:47,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2018-04-13 06:28:47,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 705. [2018-04-13 06:28:47,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 705 states. [2018-04-13 06:28:47,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 937 transitions. [2018-04-13 06:28:47,077 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 937 transitions. Word has length 53 [2018-04-13 06:28:47,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:28:47,077 INFO L459 AbstractCegarLoop]: Abstraction has 705 states and 937 transitions. [2018-04-13 06:28:47,077 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-13 06:28:47,077 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 937 transitions. [2018-04-13 06:28:47,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-13 06:28:47,078 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:28:47,078 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:28:47,078 INFO L408 AbstractCegarLoop]: === Iteration 56 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:28:47,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1555912095, now seen corresponding path program 1 times [2018-04-13 06:28:47,078 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:28:47,078 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:28:47,078 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:28:47,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:28:47,078 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:28:47,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:28:47,084 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:28:47,086 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:28:47,086 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:28:47,086 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:28:47,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:28:47,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:28:47,131 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:28:47,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 06:28:47,133 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:47,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:47,136 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 06:28:47,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 06:28:47,147 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:47,154 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 06:28:47,154 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:47,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:47,159 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2018-04-13 06:28:47,169 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 06:28:47,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 06:28:47,171 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:47,172 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:47,181 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 06:28:47,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 06:28:47,182 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:47,183 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:47,190 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 06:28:47,190 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:40 [2018-04-13 06:28:47,219 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 34 treesize of output 44 [2018-04-13 06:28:47,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2018-04-13 06:28:47,221 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:47,238 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:47,256 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 30 treesize of output 40 [2018-04-13 06:28:47,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2018-04-13 06:28:47,258 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:47,271 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:47,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:47,278 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:71, output treesize:40 [2018-04-13 06:28:47,294 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:47,295 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:47,295 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:47,296 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 28 treesize of output 42 [2018-04-13 06:28:47,296 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:47,310 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:47,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 39 [2018-04-13 06:28:47,311 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:47,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:47,327 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:66, output treesize:63 [2018-04-13 06:28:47,370 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 23 treesize of output 18 [2018-04-13 06:28:47,372 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:47,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 18 treesize of output 27 [2018-04-13 06:28:47,373 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:47,378 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:47,401 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 36 treesize of output 29 [2018-04-13 06:28:47,402 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:47,403 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:47,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 50 [2018-04-13 06:28:47,403 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:47,409 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:47,421 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 06:28:47,422 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:86, output treesize:78 [2018-04-13 06:28:47,449 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 30 treesize of output 37 [2018-04-13 06:28:47,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 19 [2018-04-13 06:28:47,452 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:47,457 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:47,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 63 [2018-04-13 06:28:47,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 13 [2018-04-13 06:28:47,479 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:47,486 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:47,512 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 06:28:47,512 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:100, output treesize:110 [2018-04-13 06:28:47,542 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 77 treesize of output 76 [2018-04-13 06:28:47,544 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:47,544 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 22 treesize of output 35 [2018-04-13 06:28:47,544 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:47,553 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:47,579 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 64 treesize of output 78 [2018-04-13 06:28:47,581 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:47,581 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 28 treesize of output 47 [2018-04-13 06:28:47,581 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:47,590 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:47,608 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 06:28:47,609 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:136, output treesize:134 [2018-04-13 06:28:47,641 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:47,642 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:47,643 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:47,644 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:47,644 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:47,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, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2018-04-13 06:28:47,645 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:47,670 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:47,670 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:47,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 72 [2018-04-13 06:28:47,671 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:47,694 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 06:28:47,694 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:148, output treesize:141 [2018-04-13 06:28:47,727 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 79 treesize of output 85 [2018-04-13 06:28:47,729 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:47,730 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:47,731 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:47,731 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 35 treesize of output 82 [2018-04-13 06:28:47,731 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:47,742 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:47,777 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:47,778 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 126 treesize of output 134 [2018-04-13 06:28:47,787 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:47,788 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:47,788 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:47,790 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 40 treesize of output 72 [2018-04-13 06:28:47,790 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:47,806 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:47,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:28:47,828 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:164, output treesize:167 [2018-04-13 06:28:47,895 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:47,900 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:47,916 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 173 treesize of output 169 [2018-04-13 06:28:47,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 208 treesize of output 207 [2018-04-13 06:28:47,921 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:48,034 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:48,035 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:48,036 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:48,037 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:48,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 139 treesize of output 201 [2018-04-13 06:28:48,047 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-13 06:28:48,140 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:48,141 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:48,143 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:48,150 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 149 treesize of output 151 [2018-04-13 06:28:48,151 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-13 06:28:48,218 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-04-13 06:28:48,289 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:48,292 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 146 treesize of output 139 [2018-04-13 06:28:48,295 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:48,296 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 45 treesize of output 46 [2018-04-13 06:28:48,297 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:48,317 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:48,320 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:48,340 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 198 treesize of output 217 [2018-04-13 06:28:48,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 219 treesize of output 218 [2018-04-13 06:28:48,345 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:48,689 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:48,689 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:48,697 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 190 treesize of output 205 [2018-04-13 06:28:48,697 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-04-13 06:28:48,824 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:48,825 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:48,826 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:48,827 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:48,842 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 172 treesize of output 223 [2018-04-13 06:28:48,843 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-04-13 06:28:48,944 INFO L267 ElimStorePlain]: Start of recursive call 8: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-13 06:28:48,946 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:48,950 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 160 treesize of output 149 [2018-04-13 06:28:48,952 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:48,952 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:48,954 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 36 treesize of output 84 [2018-04-13 06:28:48,955 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:48,984 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:49,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-04-13 06:28:49,091 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:208, output treesize:551 [2018-04-13 06:28:49,186 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:49,187 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:49,189 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:49,193 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 101 treesize of output 122 [2018-04-13 06:28:49,194 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 06:28:49,264 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:49,265 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:49,267 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:49,272 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 141 treesize of output 186 [2018-04-13 06:28:49,272 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 06:28:49,365 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 4 xjuncts. [2018-04-13 06:28:49,365 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:243, output treesize:525 [2018-04-13 06:28:49,514 WARN L151 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 137 DAG size of output 129 [2018-04-13 06:28:49,521 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:49,522 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:49,522 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 140 treesize of output 115 [2018-04-13 06:28:49,531 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 38 [2018-04-13 06:28:49,532 INFO L267 ElimStorePlain]: Start of recursive call 3: 6 dim-0 vars, End of recursive call: 6 dim-0 vars, and 4 xjuncts. [2018-04-13 06:28:49,565 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:49,566 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:49,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, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 52 [2018-04-13 06:28:49,567 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 06:28:49,569 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:49,571 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:49,577 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 74 [2018-04-13 06:28:49,578 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-04-13 06:28:49,581 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:49,584 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:49,592 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 78 [2018-04-13 06:28:49,593 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-04-13 06:28:49,596 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:49,598 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:49,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 70 [2018-04-13 06:28:49,603 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 06:28:49,796 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 15 dim-0 vars, and 9 xjuncts. [2018-04-13 06:28:50,041 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:50,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 110 [2018-04-13 06:28:50,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-13 06:28:50,044 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:50,055 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:50,291 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:50,292 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:50,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 84 treesize of output 72 [2018-04-13 06:28:50,305 INFO L477 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 50 [2018-04-13 06:28:50,307 INFO L267 ElimStorePlain]: Start of recursive call 11: 6 dim-0 vars, End of recursive call: 6 dim-0 vars, and 4 xjuncts. [2018-04-13 06:28:50,340 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 47 [2018-04-13 06:28:50,341 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-04-13 06:28:50,343 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 38 treesize of output 27 [2018-04-13 06:28:50,343 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:50,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 35 [2018-04-13 06:28:50,345 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:50,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 39 [2018-04-13 06:28:50,350 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-04-13 06:28:50,392 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-04-13 06:28:50,669 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:50,670 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:50,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 92 [2018-04-13 06:28:50,675 INFO L477 Elim1Store]: Elim1 applied some 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 1 case distinctions, treesize of input 25 treesize of output 26 [2018-04-13 06:28:50,675 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-13 06:28:50,694 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2018-04-13 06:28:50,694 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:28:50,706 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:28:50,957 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:50,958 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:50,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 135 [2018-04-13 06:28:50,968 INFO L477 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 46 [2018-04-13 06:28:50,969 INFO L267 ElimStorePlain]: Start of recursive call 20: 6 dim-0 vars, End of recursive call: 6 dim-0 vars, and 4 xjuncts. [2018-04-13 06:28:51,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 74 [2018-04-13 06:28:51,013 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 06:28:51,014 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 56 [2018-04-13 06:28:51,015 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:28:51,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 91 treesize of output 78 [2018-04-13 06:28:51,025 INFO L267 ElimStorePlain]: Start of recursive call 23: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-04-13 06:28:51,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 82 [2018-04-13 06:28:51,039 INFO L267 ElimStorePlain]: Start of recursive call 24: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-04-13 06:28:51,248 INFO L267 ElimStorePlain]: Start of recursive call 19: 2 dim-1 vars, End of recursive call: 15 dim-0 vars, and 9 xjuncts. [2018-04-13 06:28:51,774 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 68 treesize of output 58 [2018-04-13 06:28:51,775 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:51,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, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-04-13 06:28:51,776 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:51,783 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:51,785 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 68 treesize of output 58 [2018-04-13 06:28:51,786 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:51,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-04-13 06:28:51,787 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:51,794 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:51,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, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 58 [2018-04-13 06:28:51,797 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:51,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 18 treesize of output 10 [2018-04-13 06:28:51,798 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:51,805 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:51,807 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 68 treesize of output 58 [2018-04-13 06:28:51,809 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:51,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-04-13 06:28:51,809 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:51,817 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:51,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 58 [2018-04-13 06:28:51,820 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:51,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-04-13 06:28:51,821 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:51,828 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:51,830 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 68 treesize of output 58 [2018-04-13 06:28:51,832 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:51,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-04-13 06:28:51,832 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:51,842 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:51,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 62 [2018-04-13 06:28:51,846 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:51,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-04-13 06:28:51,846 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:51,855 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:51,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, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 58 [2018-04-13 06:28:51,859 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:51,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-04-13 06:28:51,860 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:51,868 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:51,870 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 68 treesize of output 58 [2018-04-13 06:28:51,871 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:51,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-04-13 06:28:51,872 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:51,880 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:52,292 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 63 treesize of output 53 [2018-04-13 06:28:52,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-13 06:28:52,294 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:52,302 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:52,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 76 treesize of output 66 [2018-04-13 06:28:52,698 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:52,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-04-13 06:28:52,698 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:52,708 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:52,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 66 [2018-04-13 06:28:52,712 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:52,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-04-13 06:28:52,712 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:52,722 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:52,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 70 [2018-04-13 06:28:52,727 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:52,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-04-13 06:28:52,727 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:52,738 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:52,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 76 treesize of output 66 [2018-04-13 06:28:52,742 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:52,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-04-13 06:28:52,742 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:52,753 INFO L267 ElimStorePlain]: Start of recursive call 51: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:52,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 76 treesize of output 66 [2018-04-13 06:28:52,756 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:52,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-04-13 06:28:52,757 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:52,766 INFO L267 ElimStorePlain]: Start of recursive call 53: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:52,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 76 treesize of output 66 [2018-04-13 06:28:52,769 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:52,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-04-13 06:28:52,769 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:52,779 INFO L267 ElimStorePlain]: Start of recursive call 55: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:52,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 76 treesize of output 66 [2018-04-13 06:28:52,782 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:52,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-04-13 06:28:52,783 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:52,793 INFO L267 ElimStorePlain]: Start of recursive call 57: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:52,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 76 treesize of output 66 [2018-04-13 06:28:52,796 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:52,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-04-13 06:28:52,797 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:52,809 INFO L267 ElimStorePlain]: Start of recursive call 59: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:52,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 76 treesize of output 66 [2018-04-13 06:28:52,812 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:52,813 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-04-13 06:28:52,813 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:52,823 INFO L267 ElimStorePlain]: Start of recursive call 61: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:53,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 8 dim-2 vars, End of recursive call: 39 dim-0 vars, and 23 xjuncts. [2018-04-13 06:28:53,121 INFO L202 ElimStorePlain]: Needed 62 recursive calls to eliminate 16 variables, input treesize:531, output treesize:642 [2018-04-13 06:28:53,427 WARN L151 SmtUtils]: Spent 218ms on a formula simplification. DAG size of input: 293 DAG size of output 39 [2018-04-13 06:28:53,444 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 06:28:53,444 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:28:53,445 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-04-13 06:28:53,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-13 06:28:53,445 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-13 06:28:53,445 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=278, Unknown=3, NotChecked=0, Total=342 [2018-04-13 06:28:53,445 INFO L87 Difference]: Start difference. First operand 705 states and 937 transitions. Second operand 19 states. [2018-04-13 06:28:54,411 WARN L151 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 123 DAG size of output 115 [2018-04-13 06:28:54,569 WARN L151 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 109 DAG size of output 109 [2018-04-13 06:28:55,081 WARN L151 SmtUtils]: Spent 417ms on a formula simplification. DAG size of input: 168 DAG size of output 168 [2018-04-13 06:28:55,508 WARN L151 SmtUtils]: Spent 356ms on a formula simplification. DAG size of input: 203 DAG size of output 174 [2018-04-13 06:28:56,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:28:56,716 INFO L93 Difference]: Finished difference Result 1126 states and 1461 transitions. [2018-04-13 06:28:56,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-13 06:28:56,716 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 53 [2018-04-13 06:28:56,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:28:56,717 INFO L225 Difference]: With dead ends: 1126 [2018-04-13 06:28:56,717 INFO L226 Difference]: Without dead ends: 1126 [2018-04-13 06:28:56,717 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=371, Invalid=1106, Unknown=5, NotChecked=0, Total=1482 [2018-04-13 06:28:56,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1126 states. [2018-04-13 06:28:56,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1126 to 701. [2018-04-13 06:28:56,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 701 states. [2018-04-13 06:28:56,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 932 transitions. [2018-04-13 06:28:56,721 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 932 transitions. Word has length 53 [2018-04-13 06:28:56,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:28:56,722 INFO L459 AbstractCegarLoop]: Abstraction has 701 states and 932 transitions. [2018-04-13 06:28:56,722 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-13 06:28:56,722 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 932 transitions. [2018-04-13 06:28:56,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-13 06:28:56,722 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:28:56,722 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] [2018-04-13 06:28:56,722 INFO L408 AbstractCegarLoop]: === Iteration 57 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:28:56,723 INFO L82 PathProgramCache]: Analyzing trace with hash -303772345, now seen corresponding path program 1 times [2018-04-13 06:28:56,723 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:28:56,723 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:28:56,723 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:28:56,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:28:56,723 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:28:56,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:28:56,729 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:28:56,731 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:28:56,731 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:28:56,731 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:28:56,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:28:56,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:28:56,752 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:28:56,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 06:28:56,760 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:56,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:56,762 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 06:28:56,770 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 06:28:56,770 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:56,772 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:56,772 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2018-04-13 06:28:56,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-13 06:28:56,793 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:56,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:56,798 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:17 [2018-04-13 06:28:56,813 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 14 treesize of output 20 [2018-04-13 06:28:56,813 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 06:28:56,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:56,822 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:22 [2018-04-13 06:28:56,870 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:56,870 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:56,871 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 06:28:56,871 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:56,882 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:56,883 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:56,888 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 3 case distinctions, treesize of input 19 treesize of output 32 [2018-04-13 06:28:56,888 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 06:28:56,905 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 2 xjuncts. [2018-04-13 06:28:56,906 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:50 [2018-04-13 06:28:56,992 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 06:28:56,992 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 06:28:56,992 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-13 06:28:56,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-13 06:28:56,993 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-13 06:28:56,993 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-04-13 06:28:56,993 INFO L87 Difference]: Start difference. First operand 701 states and 932 transitions. Second operand 16 states. [2018-04-13 06:28:58,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:28:58,947 INFO L93 Difference]: Finished difference Result 1934 states and 2364 transitions. [2018-04-13 06:28:58,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-13 06:28:58,948 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 53 [2018-04-13 06:28:58,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:28:58,949 INFO L225 Difference]: With dead ends: 1934 [2018-04-13 06:28:58,949 INFO L226 Difference]: Without dead ends: 1934 [2018-04-13 06:28:58,949 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=395, Invalid=1411, Unknown=0, NotChecked=0, Total=1806 [2018-04-13 06:28:58,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1934 states. [2018-04-13 06:28:58,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1934 to 775. [2018-04-13 06:28:58,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2018-04-13 06:28:58,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1030 transitions. [2018-04-13 06:28:58,956 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1030 transitions. Word has length 53 [2018-04-13 06:28:58,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:28:58,956 INFO L459 AbstractCegarLoop]: Abstraction has 775 states and 1030 transitions. [2018-04-13 06:28:58,956 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-13 06:28:58,956 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1030 transitions. [2018-04-13 06:28:58,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-13 06:28:58,957 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:28:58,957 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:28:58,957 INFO L408 AbstractCegarLoop]: === Iteration 58 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:28:58,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1724885864, now seen corresponding path program 1 times [2018-04-13 06:28:58,957 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:28:58,957 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:28:58,958 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:28:58,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:28:58,958 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:28:58,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:28:58,965 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:28:58,967 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:28:58,968 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:28:58,968 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:28:58,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:28:59,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:28:59,028 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:28:59,044 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 06:28:59,044 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:59,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:59,046 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2018-04-13 06:28:59,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 6 treesize of output 5 [2018-04-13 06:28:59,049 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:59,052 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:59,052 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 06:28:59,059 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:59,060 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:59,061 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 13 treesize of output 14 [2018-04-13 06:28:59,061 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:59,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-13 06:28:59,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 06:28:59,071 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:59,073 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:59,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:59,077 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:34, output treesize:19 [2018-04-13 06:28:59,093 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 34 treesize of output 28 [2018-04-13 06:28:59,094 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-13 06:28:59,094 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:59,097 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:59,101 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 06:28:59,101 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:19 [2018-04-13 06:28:59,112 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:59,113 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:59,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-13 06:28:59,114 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:59,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:59,121 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:34 [2018-04-13 06:28:59,146 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 22 treesize of output 17 [2018-04-13 06:28:59,147 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:59,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-13 06:28:59,149 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:59,152 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:59,159 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 06:28:59,159 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:38 [2018-04-13 06:28:59,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-13 06:28:59,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 06:28:59,177 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:59,181 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:59,190 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 06:28:59,190 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2018-04-13 06:28:59,210 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 38 treesize of output 37 [2018-04-13 06:28:59,212 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:59,212 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 06:28:59,213 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:59,219 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:59,227 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 06:28:59,228 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:54 [2018-04-13 06:28:59,248 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:59,248 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:59,249 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:59,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2018-04-13 06:28:59,250 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:59,259 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 06:28:59,260 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:59, output treesize:52 [2018-04-13 06:28:59,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 44 [2018-04-13 06:28:59,284 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:59,284 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:59,285 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:28:59,286 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 06:28:59,286 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:59,295 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:59,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:28:59,305 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:64 [2018-04-13 06:28:59,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 83 [2018-04-13 06:28:59,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-04-13 06:28:59,360 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:28:59,368 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:28:59,378 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 06:28:59,379 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:112, output treesize:81 [2018-04-13 06:29:03,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 06:29:03,421 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:29:03,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 06:29:03,432 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:90, output treesize:89 [2018-04-13 06:29:03,478 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:29:03,478 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:29:03,479 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 13 treesize of output 14 [2018-04-13 06:29:03,479 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:29:03,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 06:29:03,490 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:105, output treesize:97 [2018-04-13 06:29:03,586 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 98 [2018-04-13 06:29:03,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 105 [2018-04-13 06:29:03,589 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:29:03,622 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:29:03,623 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:29:03,624 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:29:03,641 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 6 case distinctions, treesize of input 69 treesize of output 109 [2018-04-13 06:29:03,642 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 8 xjuncts. [2018-04-13 06:29:03,709 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-13 06:29:03,757 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2018-04-13 06:29:03,757 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:110, output treesize:326 [2018-04-13 06:29:32,699 WARN L148 SmtUtils]: Spent 28909ms on a formula simplification that was a NOOP. DAG size: 95 [2018-04-13 06:29:32,705 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 74 treesize of output 59 [2018-04-13 06:29:32,707 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:29:32,707 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 13 treesize of output 6 [2018-04-13 06:29:32,707 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:29:32,716 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:29:32,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 20 [2018-04-13 06:29:32,717 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:29:32,723 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:29:32,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 70 [2018-04-13 06:29:32,769 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:29:32,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2018-04-13 06:29:32,770 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 06:29:32,778 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:29:32,779 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 14 treesize of output 11 [2018-04-13 06:29:32,779 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 06:29:32,788 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:29:32,835 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 101 treesize of output 72 [2018-04-13 06:29:32,837 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:29:32,837 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:29:32,838 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:29:32,839 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2018-04-13 06:29:32,839 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-13 06:29:32,848 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:29:32,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 20 [2018-04-13 06:29:32,849 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-13 06:29:32,853 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:29:32,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 70 [2018-04-13 06:29:32,883 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:29:32,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2018-04-13 06:29:32,884 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-13 06:29:32,892 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:29:32,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 20 [2018-04-13 06:29:32,893 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-13 06:29:32,899 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:29:32,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:29:32,918 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 20 variables, input treesize:362, output treesize:5 [2018-04-13 06:29:32,938 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 06:29:32,939 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:29:32,939 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-04-13 06:29:32,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-13 06:29:32,939 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-13 06:29:32,939 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=382, Unknown=2, NotChecked=0, Total=462 [2018-04-13 06:29:32,939 INFO L87 Difference]: Start difference. First operand 775 states and 1030 transitions. Second operand 22 states. [2018-04-13 06:30:32,047 WARN L151 SmtUtils]: Spent 48435ms on a formula simplification. DAG size of input: 113 DAG size of output 113 [2018-04-13 06:31:21,529 WARN L151 SmtUtils]: Spent 48894ms on a formula simplification. DAG size of input: 116 DAG size of output 116 [2018-04-13 06:31:44,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:31:44,052 INFO L93 Difference]: Finished difference Result 1158 states and 1476 transitions. [2018-04-13 06:31:44,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-13 06:31:44,052 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 53 [2018-04-13 06:31:44,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:31:44,053 INFO L225 Difference]: With dead ends: 1158 [2018-04-13 06:31:44,053 INFO L226 Difference]: Without dead ends: 1158 [2018-04-13 06:31:44,053 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 159.9s TimeCoverageRelationStatistics Valid=392, Invalid=1662, Unknown=16, NotChecked=0, Total=2070 [2018-04-13 06:31:44,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2018-04-13 06:31:44,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 783. [2018-04-13 06:31:44,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2018-04-13 06:31:44,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1039 transitions. [2018-04-13 06:31:44,057 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1039 transitions. Word has length 53 [2018-04-13 06:31:44,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:31:44,057 INFO L459 AbstractCegarLoop]: Abstraction has 783 states and 1039 transitions. [2018-04-13 06:31:44,057 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-13 06:31:44,057 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1039 transitions. [2018-04-13 06:31:44,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-13 06:31:44,058 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:31:44,058 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:31:44,058 INFO L408 AbstractCegarLoop]: === Iteration 59 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:31:44,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1724885865, now seen corresponding path program 1 times [2018-04-13 06:31:44,058 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:31:44,058 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:31:44,059 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:31:44,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:31:44,059 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:31:44,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:31:44,064 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:31:44,067 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:31:44,067 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:31:44,067 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:31:44,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:31:44,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:31:44,103 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:31:44,108 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 06:31:44,108 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:31:44,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:31:44,109 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2018-04-13 06:31:44,119 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 06:31:44,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 06:31:44,149 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:31:44,151 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:31:44,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 13 treesize of output 10 [2018-04-13 06:31:44,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 06:31:44,159 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:31:44,160 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:31:44,164 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 06:31:44,164 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:38, output treesize:18 [2018-04-13 06:31:44,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-13 06:31:44,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-04-13 06:31:44,170 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:31:44,171 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:31:44,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:31:44,173 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:12 [2018-04-13 06:31:44,180 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 06:31:44,181 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 06:31:44,181 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:31:44,182 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:31:44,185 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 06:31:44,185 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:23, output treesize:9 [2018-04-13 06:31:44,201 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:31:44,201 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:31:44,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 06:31:44,202 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:31:44,205 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:31:44,205 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-13 06:31:44,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 06:31:44,221 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 06:31:44,221 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:31:44,222 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:31:44,226 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 06:31:44,227 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-04-13 06:31:44,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-04-13 06:31:44,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 06:31:44,241 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:31:44,244 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:31:44,249 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 06:31:44,249 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:30 [2018-04-13 06:31:44,265 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 27 [2018-04-13 06:31:44,267 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:31:44,267 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 06:31:44,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:31:44,272 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:31:44,278 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 06:31:44,278 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:39 [2018-04-13 06:31:44,295 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:31:44,296 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:31:44,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 06:31:44,296 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:31:44,303 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 06:31:44,303 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:38 [2018-04-13 06:31:44,329 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 37 treesize of output 34 [2018-04-13 06:31:44,331 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:31:44,332 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:31:44,332 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:31:44,334 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 23 treesize of output 46 [2018-04-13 06:31:44,334 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:31:44,342 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:31:44,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:31:44,350 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:44 [2018-04-13 06:31:44,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 68 [2018-04-13 06:31:44,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 82 [2018-04-13 06:31:44,404 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:31:44,423 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:31:44,424 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:31:44,425 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:31:44,440 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 6 case distinctions, treesize of input 44 treesize of output 97 [2018-04-13 06:31:44,441 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 8 xjuncts. [2018-04-13 06:31:44,480 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-13 06:31:44,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2018-04-13 06:31:44,509 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:84, output treesize:185 [2018-04-13 06:32:03,254 WARN L148 SmtUtils]: Spent 14655ms on a formula simplification that was a NOOP. DAG size: 78 [2018-04-13 06:32:03,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 50 [2018-04-13 06:32:03,262 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:32:03,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 50 [2018-04-13 06:32:03,264 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:32:03,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 46 [2018-04-13 06:32:03,265 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:32:03,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 58 [2018-04-13 06:32:03,271 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:32:03,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-1 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2018-04-13 06:32:03,302 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 9 variables, input treesize:209, output treesize:205 [2018-04-13 06:32:22,623 WARN L148 SmtUtils]: Spent 19293ms on a formula simplification that was a NOOP. DAG size: 82 [2018-04-13 06:32:44,430 WARN L148 SmtUtils]: Spent 21773ms on a formula simplification that was a NOOP. DAG size: 82 [2018-04-13 06:32:55,062 WARN L148 SmtUtils]: Spent 10591ms on a formula simplification that was a NOOP. DAG size: 95 [2018-04-13 06:32:55,254 WARN L148 SmtUtils]: Spent 147ms on a formula simplification that was a NOOP. DAG size: 95 [2018-04-13 06:32:55,263 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:32:55,287 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 116 [2018-04-13 06:32:55,289 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:32:55,302 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 4 case distinctions, treesize of input 99 treesize of output 122 [2018-04-13 06:32:55,303 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-04-13 06:32:55,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 100 treesize of output 99 [2018-04-13 06:32:55,399 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:32:55,457 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-13 06:32:55,690 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:32:55,693 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 86 treesize of output 91 [2018-04-13 06:32:55,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 13 [2018-04-13 06:32:55,695 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 06:32:55,709 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:32:55,711 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:32:55,714 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 86 treesize of output 91 [2018-04-13 06:32:55,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 13 [2018-04-13 06:32:55,716 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-13 06:32:55,730 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:32:55,732 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:32:55,735 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 99 treesize of output 100 [2018-04-13 06:32:55,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 06:32:55,736 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-13 06:32:55,751 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:32:55,970 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:32:55,986 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 120 [2018-04-13 06:32:55,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 115 [2018-04-13 06:32:55,989 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-13 06:32:56,045 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:32:56,069 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 4 case distinctions, treesize of input 91 treesize of output 114 [2018-04-13 06:32:56,069 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 4 xjuncts. [2018-04-13 06:32:56,135 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-13 06:32:56,387 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:32:56,403 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 115 treesize of output 122 [2018-04-13 06:32:56,405 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:32:56,406 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:32:56,407 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:32:56,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 105 treesize of output 149 [2018-04-13 06:32:56,429 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 8 xjuncts. [2018-04-13 06:32:56,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 111 [2018-04-13 06:32:56,570 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-13 06:32:56,657 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-13 06:32:57,003 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:32:57,005 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 94 treesize of output 99 [2018-04-13 06:32:57,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 13 [2018-04-13 06:32:57,007 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-13 06:32:57,022 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:32:57,024 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:32:57,026 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 93 treesize of output 98 [2018-04-13 06:32:57,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 13 [2018-04-13 06:32:57,028 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-13 06:32:57,043 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:32:57,044 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:32:57,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 112 [2018-04-13 06:32:57,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 06:32:57,048 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-13 06:32:57,064 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:32:57,066 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:32:57,069 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 94 treesize of output 99 [2018-04-13 06:32:57,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 06:32:57,071 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-13 06:32:57,086 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:32:57,445 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:32:57,461 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 120 [2018-04-13 06:32:57,463 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:32:57,477 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 4 case distinctions, treesize of input 103 treesize of output 126 [2018-04-13 06:32:57,477 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 4 xjuncts. [2018-04-13 06:32:57,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 103 [2018-04-13 06:32:57,575 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-04-13 06:32:57,633 INFO L267 ElimStorePlain]: Start of recursive call 25: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-13 06:32:57,993 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:32:57,995 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 103 treesize of output 104 [2018-04-13 06:32:57,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 06:32:57,997 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-04-13 06:32:58,012 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:32:58,013 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:32:58,016 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 90 treesize of output 95 [2018-04-13 06:32:58,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-13 06:32:58,018 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-04-13 06:32:58,033 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:32:58,035 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:32:58,037 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 86 treesize of output 91 [2018-04-13 06:32:58,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 13 [2018-04-13 06:32:58,039 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-04-13 06:32:58,055 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:32:58,370 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:32:58,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 91 [2018-04-13 06:32:58,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 06:32:58,374 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-04-13 06:32:58,390 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:32:58,392 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:32:58,399 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 103 treesize of output 104 [2018-04-13 06:32:58,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 06:32:58,401 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-04-13 06:32:58,420 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:32:58,422 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:32:58,424 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 90 treesize of output 95 [2018-04-13 06:32:58,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 13 [2018-04-13 06:32:58,426 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-04-13 06:32:58,442 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:32:58,765 INFO L267 ElimStorePlain]: Start of recursive call 1: 24 dim-0 vars, 8 dim-2 vars, End of recursive call: 30 dim-0 vars, and 13 xjuncts. [2018-04-13 06:32:58,765 INFO L202 ElimStorePlain]: Needed 39 recursive calls to eliminate 32 variables, input treesize:433, output treesize:966 [2018-04-13 06:32:59,672 WARN L151 SmtUtils]: Spent 824ms on a formula simplification. DAG size of input: 234 DAG size of output 176 [2018-04-13 06:32:59,683 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 86 treesize of output 80 [2018-04-13 06:32:59,684 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 17 [2018-04-13 06:32:59,685 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:32:59,694 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:32:59,850 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:32:59,851 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 82 treesize of output 81 [2018-04-13 06:32:59,852 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 06:32:59,852 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:32:59,863 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:32:59,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-04-13 06:32:59,865 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:32:59,873 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:33:00,044 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 103 treesize of output 88 [2018-04-13 06:33:00,046 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:00,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-04-13 06:33:00,047 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:00,059 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:00,060 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 31 treesize of output 24 [2018-04-13 06:33:00,060 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:00,069 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:33:00,217 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 50 treesize of output 44 [2018-04-13 06:33:00,218 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 26 treesize of output 11 [2018-04-13 06:33:00,218 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:00,224 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:33:00,378 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 103 treesize of output 88 [2018-04-13 06:33:00,380 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:00,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-04-13 06:33:00,381 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:00,394 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:00,395 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 31 treesize of output 24 [2018-04-13 06:33:00,396 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:00,405 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:33:00,549 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:00,550 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 82 treesize of output 81 [2018-04-13 06:33:00,552 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 06:33:00,552 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:00,572 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:00,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-04-13 06:33:00,573 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:33:00,589 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:33:00,718 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:00,719 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 94 treesize of output 87 [2018-04-13 06:33:00,721 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:00,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2018-04-13 06:33:00,722 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:33:00,735 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:00,736 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 14 treesize of output 11 [2018-04-13 06:33:00,736 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:00,744 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:33:00,863 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 50 treesize of output 44 [2018-04-13 06:33:00,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 11 [2018-04-13 06:33:00,865 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:00,873 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:33:00,994 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 50 treesize of output 44 [2018-04-13 06:33:00,995 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 26 treesize of output 11 [2018-04-13 06:33:00,995 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:01,001 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:33:01,118 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:01,119 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 82 treesize of output 81 [2018-04-13 06:33:01,121 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:01,122 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 38 treesize of output 29 [2018-04-13 06:33:01,122 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:33:01,137 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 06:33:01,137 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:01,147 INFO L267 ElimStorePlain]: Start of recursive call 25: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:33:01,265 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 50 treesize of output 44 [2018-04-13 06:33:01,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 11 [2018-04-13 06:33:01,266 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:01,272 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:33:01,383 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 50 treesize of output 44 [2018-04-13 06:33:01,385 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 26 treesize of output 11 [2018-04-13 06:33:01,385 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:01,391 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:33:01,499 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 111 treesize of output 92 [2018-04-13 06:33:01,502 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:01,503 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 31 treesize of output 24 [2018-04-13 06:33:01,503 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:01,517 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:01,518 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:01,518 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33: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, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-04-13 06:33:01,520 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:01,530 INFO L267 ElimStorePlain]: Start of recursive call 32: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:33:01,631 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 50 treesize of output 44 [2018-04-13 06:33:01,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 11 [2018-04-13 06:33:01,632 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:01,638 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:33:01,730 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 86 [2018-04-13 06:33:01,732 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:01,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-04-13 06:33:01,734 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:01,747 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:01,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-04-13 06:33:01,747 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:01,755 INFO L267 ElimStorePlain]: Start of recursive call 37: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:33:01,843 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 50 treesize of output 44 [2018-04-13 06:33:01,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 11 [2018-04-13 06:33:01,844 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:01,850 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:33:01,934 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:01,935 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 65 treesize of output 62 [2018-04-13 06:33:01,937 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:01,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2018-04-13 06:33:01,938 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:01,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-04-13 06:33:01,948 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:33:01,954 INFO L267 ElimStorePlain]: Start of recursive call 42: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:33:02,040 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 50 treesize of output 44 [2018-04-13 06:33:02,041 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 26 treesize of output 11 [2018-04-13 06:33:02,041 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:02,051 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:33:02,225 INFO L267 ElimStorePlain]: Start of recursive call 1: 40 dim-0 vars, 18 dim-2 vars, End of recursive call: 18 dim-0 vars, and 9 xjuncts. [2018-04-13 06:33:02,226 INFO L202 ElimStorePlain]: Needed 46 recursive calls to eliminate 58 variables, input treesize:843, output treesize:190 [2018-04-13 06:33:02,325 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 06:33:02,325 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:33:02,325 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-04-13 06:33:02,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-13 06:33:02,326 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-13 06:33:02,326 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=424, Unknown=2, NotChecked=0, Total=506 [2018-04-13 06:33:02,326 INFO L87 Difference]: Start difference. First operand 783 states and 1039 transitions. Second operand 23 states. [2018-04-13 06:33:03,420 WARN L151 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 101 DAG size of output 97 [2018-04-13 06:33:03,708 WARN L151 SmtUtils]: Spent 165ms on a formula simplification. DAG size of input: 105 DAG size of output 105 [2018-04-13 06:33:03,971 WARN L151 SmtUtils]: Spent 193ms on a formula simplification. DAG size of input: 113 DAG size of output 108 [2018-04-13 06:33:04,397 WARN L151 SmtUtils]: Spent 343ms on a formula simplification. DAG size of input: 122 DAG size of output 117 [2018-04-13 06:33:04,867 WARN L151 SmtUtils]: Spent 394ms on a formula simplification. DAG size of input: 131 DAG size of output 122 [2018-04-13 06:33:05,965 WARN L151 SmtUtils]: Spent 949ms on a formula simplification. DAG size of input: 195 DAG size of output 195 [2018-04-13 06:33:07,323 WARN L151 SmtUtils]: Spent 1174ms on a formula simplification. DAG size of input: 203 DAG size of output 201 [2018-04-13 06:33:07,714 WARN L151 SmtUtils]: Spent 142ms on a formula simplification. DAG size of input: 95 DAG size of output 91 [2018-04-13 06:33:08,211 WARN L151 SmtUtils]: Spent 156ms on a formula simplification. DAG size of input: 100 DAG size of output 100 [2018-04-13 06:33:08,484 WARN L151 SmtUtils]: Spent 189ms on a formula simplification. DAG size of input: 108 DAG size of output 103 [2018-04-13 06:33:08,696 WARN L151 SmtUtils]: Spent 157ms on a formula simplification. DAG size of input: 98 DAG size of output 94 [2018-04-13 06:33:09,131 WARN L151 SmtUtils]: Spent 368ms on a formula simplification. DAG size of input: 121 DAG size of output 116 [2018-04-13 06:33:09,664 WARN L151 SmtUtils]: Spent 394ms on a formula simplification. DAG size of input: 130 DAG size of output 121 [2018-04-13 06:33:10,704 WARN L151 SmtUtils]: Spent 940ms on a formula simplification. DAG size of input: 194 DAG size of output 194 [2018-04-13 06:33:10,954 WARN L151 SmtUtils]: Spent 151ms on a formula simplification. DAG size of input: 90 DAG size of output 86 [2018-04-13 06:33:12,096 WARN L151 SmtUtils]: Spent 1084ms on a formula simplification. DAG size of input: 202 DAG size of output 200 [2018-04-13 06:33:13,292 WARN L151 SmtUtils]: Spent 151ms on a formula simplification. DAG size of input: 92 DAG size of output 88 [2018-04-13 06:33:13,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:33:13,951 INFO L93 Difference]: Finished difference Result 1718 states and 2129 transitions. [2018-04-13 06:33:13,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-04-13 06:33:13,952 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 53 [2018-04-13 06:33:13,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:33:13,953 INFO L225 Difference]: With dead ends: 1718 [2018-04-13 06:33:13,953 INFO L226 Difference]: Without dead ends: 1718 [2018-04-13 06:33:13,953 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1192 ImplicationChecksByTransitivity, 80.7s TimeCoverageRelationStatistics Valid=1021, Invalid=3669, Unknown=2, NotChecked=0, Total=4692 [2018-04-13 06:33:13,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1718 states. [2018-04-13 06:33:13,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1718 to 791. [2018-04-13 06:33:13,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2018-04-13 06:33:13,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1049 transitions. [2018-04-13 06:33:13,960 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1049 transitions. Word has length 53 [2018-04-13 06:33:13,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:33:13,960 INFO L459 AbstractCegarLoop]: Abstraction has 791 states and 1049 transitions. [2018-04-13 06:33:13,960 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-13 06:33:13,960 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1049 transitions. [2018-04-13 06:33:13,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-13 06:33:13,960 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:33:13,961 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:33:13,961 INFO L408 AbstractCegarLoop]: === Iteration 60 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:33:13,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1273760456, now seen corresponding path program 1 times [2018-04-13 06:33:13,961 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:33:13,961 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:33:13,961 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:33:13,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:33:13,961 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:33:13,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:33:13,966 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:33:13,968 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:33:13,968 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:33:13,968 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:33:13,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:33:13,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:33:13,990 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:33:13,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 06:33:13,991 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:13,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:33:13,994 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 06:33:14,003 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:14,003 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:14,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 06:33:14,004 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:14,007 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:33:14,007 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-13 06:33:14,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-13 06:33:14,016 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 06:33:14,017 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:14,018 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:33:14,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-13 06:33:14,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 06:33:14,027 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:14,029 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:33:14,034 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 06:33:14,034 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:39, output treesize:28 [2018-04-13 06:33:14,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 57 [2018-04-13 06:33:14,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 06:33:14,067 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:14,070 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:33:14,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 49 [2018-04-13 06:33:14,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-13 06:33:14,090 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:14,095 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:33:14,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:33:14,103 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:92, output treesize:59 [2018-04-13 06:33:14,124 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:14,125 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:14,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 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 06:33:14,125 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:14,139 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 06:33:14,139 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:74, output treesize:72 [2018-04-13 06:33:14,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 87 [2018-04-13 06:33:14,203 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 61 treesize of output 66 [2018-04-13 06:33:14,204 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 06:33:14,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2018-04-13 06:33:14,236 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:14,252 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 06:33:14,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 60 [2018-04-13 06:33:14,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 06:33:14,281 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:14,289 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:33:14,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 67 [2018-04-13 06:33:14,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 06:33:14,294 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:14,302 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:33:14,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-13 06:33:14,326 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:94, output treesize:125 [2018-04-13 06:33:14,465 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 139 treesize of output 133 [2018-04-13 06:33:14,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-04-13 06:33:14,467 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:14,481 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:33:14,522 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 125 treesize of output 116 [2018-04-13 06:33:14,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-13 06:33:14,524 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:14,536 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:33:14,575 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 115 treesize of output 109 [2018-04-13 06:33:14,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 06:33:14,576 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:14,587 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:33:14,620 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 99 [2018-04-13 06:33:14,621 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:33:14,622 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 47 treesize of output 48 [2018-04-13 06:33:14,622 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:14,634 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:33:14,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 06:33:14,661 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:274, output treesize:208 [2018-04-13 06:33:14,800 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 64 treesize of output 54 [2018-04-13 06:33:14,801 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 54 treesize of output 41 [2018-04-13 06:33:14,801 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:14,805 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:33:14,812 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 06:33:14,812 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:83, output treesize:60 [2018-04-13 06:33:14,831 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:14,832 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:14,832 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 56 treesize of output 45 [2018-04-13 06:33:14,841 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 27 [2018-04-13 06:33:14,842 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:14,848 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:33:14,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2018-04-13 06:33:14,849 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:14,853 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:33:14,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:33:14,860 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:67, output treesize:19 [2018-04-13 06:33:14,910 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 06:33:14,910 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 06:33:14,910 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-13 06:33:14,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-13 06:33:14,910 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-13 06:33:14,911 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2018-04-13 06:33:14,911 INFO L87 Difference]: Start difference. First operand 791 states and 1049 transitions. Second operand 21 states. [2018-04-13 06:33:15,451 WARN L151 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 56 DAG size of output 56 [2018-04-13 06:33:17,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:33:17,013 INFO L93 Difference]: Finished difference Result 1380 states and 1801 transitions. [2018-04-13 06:33:17,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-13 06:33:17,013 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 53 [2018-04-13 06:33:17,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:33:17,014 INFO L225 Difference]: With dead ends: 1380 [2018-04-13 06:33:17,014 INFO L226 Difference]: Without dead ends: 1380 [2018-04-13 06:33:17,015 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=375, Invalid=1605, Unknown=0, NotChecked=0, Total=1980 [2018-04-13 06:33:17,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2018-04-13 06:33:17,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 802. [2018-04-13 06:33:17,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2018-04-13 06:33:17,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 1062 transitions. [2018-04-13 06:33:17,019 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 1062 transitions. Word has length 53 [2018-04-13 06:33:17,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:33:17,020 INFO L459 AbstractCegarLoop]: Abstraction has 802 states and 1062 transitions. [2018-04-13 06:33:17,020 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-13 06:33:17,020 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1062 transitions. [2018-04-13 06:33:17,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-13 06:33:17,020 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:33:17,020 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:33:17,020 INFO L408 AbstractCegarLoop]: === Iteration 61 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:33:17,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1273760455, now seen corresponding path program 1 times [2018-04-13 06:33:17,021 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:33:17,021 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:33:17,021 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:33:17,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:33:17,021 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:33:17,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:33:17,029 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:33:17,034 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:33:17,034 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:33:17,034 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:33:17,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:33:17,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:33:17,075 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:33:17,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 06:33:17,095 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:17,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:33:17,097 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2018-04-13 06:33:17,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 06:33:17,099 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:17,101 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:33:17,102 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-13 06:33:17,108 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 06:33:17,109 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 06:33:17,109 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:17,110 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:33:17,119 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 06:33:17,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 06:33:17,120 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:17,121 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:33:17,129 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 06:33:17,129 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2018-04-13 06:33:17,150 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:17,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 78 [2018-04-13 06:33:17,154 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-13 06:33:17,154 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:17,160 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:33:17,171 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:17,173 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 60 treesize of output 64 [2018-04-13 06:33:17,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-13 06:33:17,175 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:17,179 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:33:17,188 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 06:33:17,188 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:103, output treesize:45 [2018-04-13 06:33:17,200 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:17,201 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:17,202 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:17,202 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 25 treesize of output 44 [2018-04-13 06:33:17,203 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:17,214 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:17,215 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:17,215 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 06:33:17,215 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:17,223 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:33:17,223 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:48 [2018-04-13 06:33:17,253 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:17,256 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 30 treesize of output 31 [2018-04-13 06:33:17,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 06:33:17,258 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:17,262 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:33:17,279 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:17,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-04-13 06:33:17,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 06:33:17,283 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:17,286 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:33:17,297 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 06:33:17,297 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:73, output treesize:51 [2018-04-13 06:33:17,335 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:17,338 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 62 [2018-04-13 06:33:17,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-13 06:33:17,340 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:17,345 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:33:17,361 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:17,363 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 42 treesize of output 43 [2018-04-13 06:33:17,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 06:33:17,365 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:17,370 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:33:17,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:33:17,384 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:109, output treesize:84 [2018-04-13 06:33:17,518 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:17,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 70 [2018-04-13 06:33:17,521 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:33:17,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-04-13 06:33:17,521 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:17,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 27 [2018-04-13 06:33:17,531 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 06:33:17,538 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 06:33:17,555 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:17,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 41 [2018-04-13 06:33:17,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2018-04-13 06:33:17,558 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:17,582 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:33:17,582 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2018-04-13 06:33:17,583 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:17,587 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:33:17,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 06:33:17,597 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:122, output treesize:22 [2018-04-13 06:33:17,652 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 06:33:17,652 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 06:33:17,652 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-13 06:33:17,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-13 06:33:17,652 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-13 06:33:17,652 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2018-04-13 06:33:17,652 INFO L87 Difference]: Start difference. First operand 802 states and 1062 transitions. Second operand 17 states. [2018-04-13 06:33:19,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:33:19,229 INFO L93 Difference]: Finished difference Result 1081 states and 1377 transitions. [2018-04-13 06:33:19,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-13 06:33:19,229 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 53 [2018-04-13 06:33:19,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:33:19,230 INFO L225 Difference]: With dead ends: 1081 [2018-04-13 06:33:19,230 INFO L226 Difference]: Without dead ends: 1081 [2018-04-13 06:33:19,231 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=243, Invalid=879, Unknown=0, NotChecked=0, Total=1122 [2018-04-13 06:33:19,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2018-04-13 06:33:19,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 811. [2018-04-13 06:33:19,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 811 states. [2018-04-13 06:33:19,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1074 transitions. [2018-04-13 06:33:19,235 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1074 transitions. Word has length 53 [2018-04-13 06:33:19,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:33:19,235 INFO L459 AbstractCegarLoop]: Abstraction has 811 states and 1074 transitions. [2018-04-13 06:33:19,235 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-13 06:33:19,236 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1074 transitions. [2018-04-13 06:33:19,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-13 06:33:19,236 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:33:19,236 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:33:19,236 INFO L408 AbstractCegarLoop]: === Iteration 62 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:33:19,236 INFO L82 PathProgramCache]: Analyzing trace with hash -831868191, now seen corresponding path program 1 times [2018-04-13 06:33:19,236 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:33:19,236 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:33:19,237 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:33:19,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:33:19,237 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:33:19,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:33:19,241 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:33:19,256 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 06:33:19,256 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:33:19,256 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 06:33:19,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 06:33:19,257 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 06:33:19,257 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-13 06:33:19,257 INFO L87 Difference]: Start difference. First operand 811 states and 1074 transitions. Second operand 5 states. [2018-04-13 06:33:19,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:33:19,390 INFO L93 Difference]: Finished difference Result 810 states and 1068 transitions. [2018-04-13 06:33:19,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-13 06:33:19,390 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-04-13 06:33:19,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:33:19,391 INFO L225 Difference]: With dead ends: 810 [2018-04-13 06:33:19,391 INFO L226 Difference]: Without dead ends: 810 [2018-04-13 06:33:19,391 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-04-13 06:33:19,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2018-04-13 06:33:19,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 810. [2018-04-13 06:33:19,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 810 states. [2018-04-13 06:33:19,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 1068 transitions. [2018-04-13 06:33:19,395 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 1068 transitions. Word has length 54 [2018-04-13 06:33:19,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:33:19,395 INFO L459 AbstractCegarLoop]: Abstraction has 810 states and 1068 transitions. [2018-04-13 06:33:19,395 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 06:33:19,395 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1068 transitions. [2018-04-13 06:33:19,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-13 06:33:19,395 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:33:19,395 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:33:19,395 INFO L408 AbstractCegarLoop]: === Iteration 63 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:33:19,395 INFO L82 PathProgramCache]: Analyzing trace with hash -831868190, now seen corresponding path program 1 times [2018-04-13 06:33:19,395 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:33:19,395 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:33:19,396 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:33:19,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:33:19,396 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:33:19,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:33:19,402 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:33:19,431 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 06:33:19,432 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:33:19,432 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-13 06:33:19,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-13 06:33:19,432 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-13 06:33:19,432 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-13 06:33:19,432 INFO L87 Difference]: Start difference. First operand 810 states and 1068 transitions. Second operand 6 states. [2018-04-13 06:33:19,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:33:19,608 INFO L93 Difference]: Finished difference Result 809 states and 1062 transitions. [2018-04-13 06:33:19,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-13 06:33:19,608 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-04-13 06:33:19,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:33:19,609 INFO L225 Difference]: With dead ends: 809 [2018-04-13 06:33:19,609 INFO L226 Difference]: Without dead ends: 809 [2018-04-13 06:33:19,609 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-04-13 06:33:19,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2018-04-13 06:33:19,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 809. [2018-04-13 06:33:19,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 809 states. [2018-04-13 06:33:19,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1062 transitions. [2018-04-13 06:33:19,612 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1062 transitions. Word has length 54 [2018-04-13 06:33:19,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:33:19,612 INFO L459 AbstractCegarLoop]: Abstraction has 809 states and 1062 transitions. [2018-04-13 06:33:19,612 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-13 06:33:19,612 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1062 transitions. [2018-04-13 06:33:19,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-13 06:33:19,613 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:33:19,613 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:33:19,613 INFO L408 AbstractCegarLoop]: === Iteration 64 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:33:19,613 INFO L82 PathProgramCache]: Analyzing trace with hash -2022761456, now seen corresponding path program 1 times [2018-04-13 06:33:19,613 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:33:19,613 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:33:19,613 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:33:19,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:33:19,613 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:33:19,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:33:19,619 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:33:19,620 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:33:19,621 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:33:19,621 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:33:19,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:33:19,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:33:19,648 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:33:19,773 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 36 treesize of output 30 [2018-04-13 06:33:19,775 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:19,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, 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 16 [2018-04-13 06:33:19,776 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:19,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2018-04-13 06:33:19,785 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:19,791 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:19,796 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 1 case distinctions, treesize of input 22 treesize of output 15 [2018-04-13 06:33:19,796 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-13 06:33:19,802 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-13 06:33:19,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-13 06:33:19,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-04-13 06:33:19,814 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:19,816 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:33:19,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-13 06:33:19,824 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:65, output treesize:58 [2018-04-13 06:33:19,897 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:19,897 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 06:33:19,897 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:19,911 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:19,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, 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 06:33:19,915 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 06:33:19,937 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:19,940 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 06:33:19,941 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-13 06:33:19,958 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2018-04-13 06:33:19,958 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:50, output treesize:64 [2018-04-13 06:33:20,015 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 06:33:20,015 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:33:20,015 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-04-13 06:33:20,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-13 06:33:20,016 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-13 06:33:20,016 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-04-13 06:33:20,016 INFO L87 Difference]: Start difference. First operand 809 states and 1062 transitions. Second operand 16 states. [2018-04-13 06:33:20,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:33:20,812 INFO L93 Difference]: Finished difference Result 908 states and 1197 transitions. [2018-04-13 06:33:20,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-13 06:33:20,813 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 55 [2018-04-13 06:33:20,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:33:20,813 INFO L225 Difference]: With dead ends: 908 [2018-04-13 06:33:20,813 INFO L226 Difference]: Without dead ends: 908 [2018-04-13 06:33:20,813 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=196, Invalid=674, Unknown=0, NotChecked=0, Total=870 [2018-04-13 06:33:20,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2018-04-13 06:33:20,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 852. [2018-04-13 06:33:20,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 852 states. [2018-04-13 06:33:20,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1134 transitions. [2018-04-13 06:33:20,818 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1134 transitions. Word has length 55 [2018-04-13 06:33:20,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:33:20,818 INFO L459 AbstractCegarLoop]: Abstraction has 852 states and 1134 transitions. [2018-04-13 06:33:20,818 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-13 06:33:20,818 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1134 transitions. [2018-04-13 06:33:20,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-13 06:33:20,818 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:33:20,818 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 06:33:20,819 INFO L408 AbstractCegarLoop]: === Iteration 65 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:33:20,819 INFO L82 PathProgramCache]: Analyzing trace with hash -199412733, now seen corresponding path program 1 times [2018-04-13 06:33:20,819 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:33:20,819 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:33:20,819 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:33:20,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:33:20,819 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:33:20,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:33:20,824 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:33:20,826 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:33:20,826 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:33:20,826 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:33:20,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:33:20,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:33:20,842 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:33:20,862 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:20,863 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:20,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 06:33:20,863 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:20,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:33:20,867 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:10 [2018-04-13 06:33:20,882 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:20,882 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:20,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 06:33:20,882 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:20,887 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:20,887 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 06:33:20,887 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:20,891 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 06:33:20,891 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2018-04-13 06:33:20,918 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 06:33:20,918 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 06:33:20,918 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-04-13 06:33:20,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-13 06:33:20,918 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-13 06:33:20,919 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-04-13 06:33:20,919 INFO L87 Difference]: Start difference. First operand 852 states and 1134 transitions. Second operand 11 states. [2018-04-13 06:33:21,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:33:21,586 INFO L93 Difference]: Finished difference Result 1605 states and 2037 transitions. [2018-04-13 06:33:21,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-13 06:33:21,586 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 57 [2018-04-13 06:33:21,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:33:21,587 INFO L225 Difference]: With dead ends: 1605 [2018-04-13 06:33:21,587 INFO L226 Difference]: Without dead ends: 1605 [2018-04-13 06:33:21,588 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=162, Invalid=390, Unknown=0, NotChecked=0, Total=552 [2018-04-13 06:33:21,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1605 states. [2018-04-13 06:33:21,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1605 to 860. [2018-04-13 06:33:21,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 860 states. [2018-04-13 06:33:21,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 1138 transitions. [2018-04-13 06:33:21,593 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 1138 transitions. Word has length 57 [2018-04-13 06:33:21,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:33:21,594 INFO L459 AbstractCegarLoop]: Abstraction has 860 states and 1138 transitions. [2018-04-13 06:33:21,594 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-13 06:33:21,594 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1138 transitions. [2018-04-13 06:33:21,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-13 06:33:21,594 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:33:21,594 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:33:21,594 INFO L408 AbstractCegarLoop]: === Iteration 66 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:33:21,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1829245476, now seen corresponding path program 1 times [2018-04-13 06:33:21,594 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:33:21,594 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:33:21,595 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:33:21,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:33:21,595 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:33:21,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:33:21,600 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:33:21,601 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:33:21,601 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:33:21,601 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:33:21,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:33:21,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:33:21,653 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:33:21,659 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 06:33:21,659 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:21,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:33:21,661 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2018-04-13 06:33:21,673 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 06:33:21,675 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 06:33:21,675 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:21,676 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:33:21,686 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 06:33:21,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 06:33:21,688 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:21,689 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:33:21,697 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 06:33:21,697 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:45, output treesize:31 [2018-04-13 06:33:21,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-13 06:33:21,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-04-13 06:33:21,735 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:21,736 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:33:21,742 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:33:21,742 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:34 [2018-04-13 06:33:21,780 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 45 [2018-04-13 06:33:21,782 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:21,783 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 28 treesize of output 39 [2018-04-13 06:33:21,783 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:21,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2018-04-13 06:33:21,794 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:21,799 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:33:21,805 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 06:33:21,805 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:57, output treesize:47 [2018-04-13 06:33:22,105 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:22,106 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:22,106 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 06:33:22,106 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:22,117 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 06:33:22,117 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:72, output treesize:66 [2018-04-13 06:33:22,173 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:22,174 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:22,176 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:22,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 57 treesize of output 72 [2018-04-13 06:33:22,179 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:22,180 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:22,182 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:22,183 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:22,193 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 77 treesize of output 138 [2018-04-13 06:33:22,194 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-13 06:33:22,218 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:33:22,237 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 06:33:22,237 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:76, output treesize:72 [2018-04-13 06:33:22,281 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:22,283 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:22,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 99 [2018-04-13 06:33:22,306 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:22,316 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 82 treesize of output 114 [2018-04-13 06:33:22,318 INFO L267 ElimStorePlain]: Start of recursive call 3: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 7 xjuncts. [2018-04-13 06:33:22,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 06:33:22,378 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:22,400 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 06:33:22,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-13 06:33:22,430 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:83, output treesize:149 [2018-04-13 06:33:22,486 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:22,487 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 82 treesize of output 88 [2018-04-13 06:33:22,495 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:22,496 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 27 treesize of output 31 [2018-04-13 06:33:22,496 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:22,514 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:33:22,552 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:22,556 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:22,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 92 treesize of output 121 [2018-04-13 06:33:22,571 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:22,572 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 121 treesize of output 128 [2018-04-13 06:33:22,572 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:22,650 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:22,651 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:22,652 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:22,657 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 2 case distinctions, treesize of input 88 treesize of output 121 [2018-04-13 06:33:22,657 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-13 06:33:22,707 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 06:33:22,772 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-13 06:33:22,772 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:175, output treesize:245 [2018-04-13 06:33:22,851 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 79 [2018-04-13 06:33:22,851 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:22,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 87 [2018-04-13 06:33:22,871 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:22,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 93 [2018-04-13 06:33:22,874 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:22,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-13 06:33:22,946 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:263, output treesize:260 [2018-04-13 06:33:23,038 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 100 treesize of output 93 [2018-04-13 06:33:23,041 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:23,041 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:23,042 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:23,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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 06:33:23,045 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:23,067 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:33:23,143 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:23,144 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:23,145 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:23,146 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 92 treesize of output 106 [2018-04-13 06:33:23,148 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:23,149 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:23,150 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:23,151 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:23,162 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 79 [2018-04-13 06:33:23,163 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-13 06:33:23,206 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:33:23,284 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:23,288 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:23,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 106 treesize of output 133 [2018-04-13 06:33:23,304 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:23,305 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:23,306 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:23,308 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 133 treesize of output 156 [2018-04-13 06:33:23,308 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:23,397 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:23,398 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:23,398 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:23,399 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:23,401 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:23,401 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:23,410 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 2 case distinctions, treesize of input 100 treesize of output 157 [2018-04-13 06:33:23,410 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-04-13 06:33:23,483 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 06:33:23,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 3 dim-2 vars, End of recursive call: 5 dim-0 vars, and 4 xjuncts. [2018-04-13 06:33:23,572 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 10 variables, input treesize:299, output treesize:371 [2018-04-13 06:33:23,910 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:23,916 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:23,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 135 treesize of output 134 [2018-04-13 06:33:23,941 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:23,942 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:23,943 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:23,944 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:23,945 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:23,949 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:23,980 INFO L477 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 9 case distinctions, treesize of input 125 treesize of output 210 [2018-04-13 06:33:23,986 INFO L267 ElimStorePlain]: Start of recursive call 3: 16 dim-0 vars, End of recursive call: 16 dim-0 vars, and 19 xjuncts. [2018-04-13 06:33:24,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 119 [2018-04-13 06:33:24,368 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:24,581 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:24,581 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:24,583 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:24,585 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:24,602 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 123 treesize of output 144 [2018-04-13 06:33:24,607 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:33:24,784 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:33:25,130 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:33:25,250 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:33:25,374 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:33:25,714 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-0 vars, 9 dim-1 vars, End of recursive call: 5 dim-0 vars, and 5 xjuncts. [2018-04-13 06:33:25,988 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 8 dim-0 vars, and 10 xjuncts. [2018-04-13 06:33:26,523 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 149 treesize of output 134 [2018-04-13 06:33:26,529 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:26,529 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:26,531 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:26,539 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:26,557 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 125 treesize of output 149 [2018-04-13 06:33:26,561 INFO L267 ElimStorePlain]: Start of recursive call 12: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 12 xjuncts. [2018-04-13 06:33:26,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 139 [2018-04-13 06:33:26,893 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:27,257 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:27,257 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:27,259 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:27,260 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:27,277 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 6 case distinctions, treesize of input 117 treesize of output 188 [2018-04-13 06:33:27,278 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 8 xjuncts. [2018-04-13 06:33:27,512 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, 4 dim-1 vars, End of recursive call: and 8 xjuncts. [2018-04-13 06:33:28,284 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:28,292 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:28,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 149 treesize of output 164 [2018-04-13 06:33:28,322 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-13 06:33:28,335 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:28,335 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:28,337 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:28,359 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 6 case distinctions, treesize of input 157 treesize of output 218 [2018-04-13 06:33:28,360 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 8 xjuncts. [2018-04-13 06:33:28,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 133 [2018-04-13 06:33:28,847 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:29,132 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 167 treesize of output 178 [2018-04-13 06:33:29,132 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 2 xjuncts. [2018-04-13 06:33:29,368 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:29,369 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:29,370 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:29,375 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:29,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 125 treesize of output 149 [2018-04-13 06:33:29,394 INFO L267 ElimStorePlain]: Start of recursive call 19: 10 dim-0 vars, End of recursive call: 12 dim-0 vars, and 12 xjuncts. [2018-04-13 06:33:29,752 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:29,753 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:29,753 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:29,754 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:29,755 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:29,758 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:29,786 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 124 treesize of output 207 [2018-04-13 06:33:29,787 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 16 xjuncts. [2018-04-13 06:33:30,295 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, 5 dim-1 vars, End of recursive call: 3 dim-0 vars, and 14 xjuncts. [2018-04-13 06:33:31,802 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 149 treesize of output 134 [2018-04-13 06:33:31,807 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:33:32,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 133 [2018-04-13 06:33:32,030 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:32,156 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:32,156 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:32,158 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:32,160 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:32,175 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 6 case distinctions, treesize of input 113 treesize of output 167 [2018-04-13 06:33:32,176 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 8 xjuncts. [2018-04-13 06:33:32,366 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:32,367 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:32,368 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:32,371 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:33:32,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 117 treesize of output 145 [2018-04-13 06:33:32,390 INFO L267 ElimStorePlain]: Start of recursive call 25: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 12 xjuncts. [2018-04-13 06:33:32,763 INFO L267 ElimStorePlain]: Start of recursive call 21: 5 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-04-13 06:33:34,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 17 dim-0 vars, 4 dim-2 vars, End of recursive call: 103 dim-0 vars, and 38 xjuncts. [2018-04-13 06:33:34,406 INFO L202 ElimStorePlain]: Needed 25 recursive calls to eliminate 21 variables, input treesize:583, output treesize:4615 [2018-04-13 06:33:44,207 WARN L151 SmtUtils]: Spent 9233ms on a formula simplification. DAG size of input: 1133 DAG size of output 947 [2018-04-13 06:33:46,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 116 treesize of output 115 [2018-04-13 06:33:46,373 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:48,673 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 122 treesize of output 121 [2018-04-13 06:33:48,673 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:50,997 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 126 treesize of output 125 [2018-04-13 06:33:50,997 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:53,289 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 137 treesize of output 136 [2018-04-13 06:33:53,290 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:55,580 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 131 treesize of output 130 [2018-04-13 06:33:55,581 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 06:33:57,916 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 105 treesize of output 104 [2018-04-13 06:33:57,917 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 06:34:00,145 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 139 treesize of output 138 [2018-04-13 06:34:00,209 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-13 06:34:02,824 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 112 treesize of output 111 [2018-04-13 06:34:02,824 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-13 06:34:04,950 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 110 treesize of output 109 [2018-04-13 06:34:04,951 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-13 06:34:07,158 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 121 treesize of output 120 [2018-04-13 06:34:07,158 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-13 06:34:09,293 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 121 treesize of output 120 [2018-04-13 06:34:09,294 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-13 06:34:11,312 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 118 treesize of output 117 [2018-04-13 06:34:11,333 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-13 06:34:13,325 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 106 treesize of output 105 [2018-04-13 06:34:13,325 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-13 06:34:15,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 06:34:15,182 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-13 06:34:17,065 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 131 treesize of output 130 [2018-04-13 06:34:17,066 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-13 06:34:18,916 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 123 treesize of output 122 [2018-04-13 06:34:18,917 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-13 06:34:20,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 137 [2018-04-13 06:34:20,843 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-13 06:34:22,735 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 138 treesize of output 137 [2018-04-13 06:34:22,735 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-13 06:34:24,522 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 125 treesize of output 124 [2018-04-13 06:34:24,523 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-13 06:34:26,333 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 129 [2018-04-13 06:34:26,333 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-13 06:34:26,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 127 [2018-04-13 06:34:26,335 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-13 06:34:26,337 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 135 treesize of output 134 [2018-04-13 06:34:26,337 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-13 06:34:28,120 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 142 treesize of output 141 [2018-04-13 06:34:28,121 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-13 06:34:29,842 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 117 treesize of output 116 [2018-04-13 06:34:29,843 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-13 06:34:31,508 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 121 treesize of output 120 [2018-04-13 06:34:31,508 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-04-13 06:34:33,185 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 124 treesize of output 123 [2018-04-13 06:34:33,185 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-04-13 06:34:34,799 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 131 treesize of output 130 [2018-04-13 06:34:34,799 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-04-13 06:34:36,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 126 treesize of output 125 [2018-04-13 06:34:36,373 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-04-13 06:34:37,946 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 110 treesize of output 109 [2018-04-13 06:34:37,946 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-04-13 06:34:39,484 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 118 treesize of output 117 [2018-04-13 06:34:39,485 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-04-13 06:34:40,959 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 114 treesize of output 113 [2018-04-13 06:34:40,959 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-04-13 06:34:42,379 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 120 treesize of output 119 [2018-04-13 06:34:42,380 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-04-13 06:34:43,754 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 116 treesize of output 115 [2018-04-13 06:34:43,754 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-04-13 06:34:45,104 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 120 treesize of output 119 [2018-04-13 06:34:45,104 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-04-13 06:34:46,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 83 dim-0 vars, 32 dim-1 vars, End of recursive call: 85 dim-0 vars, and 34 xjuncts. [2018-04-13 06:34:46,409 INFO L202 ElimStorePlain]: Needed 35 recursive calls to eliminate 115 variables, input treesize:4219, output treesize:4175 [2018-04-13 06:34:55,099 WARN L148 SmtUtils]: Spent 8221ms on a formula simplification that was a NOOP. DAG size: 967 [2018-04-13 06:35:04,250 WARN L148 SmtUtils]: Spent 8582ms on a formula simplification that was a NOOP. DAG size: 967 [2018-04-13 06:35:04,283 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35:04,285 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35:04,286 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35:04,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 121 [2018-04-13 06:35:04,287 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:35:06,075 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35:06,075 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35:06,077 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35:06,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 146 [2018-04-13 06:35:06,077 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:35:06,857 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35:06,858 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35:06,859 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35:06,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 146 [2018-04-13 06:35:06,860 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:35:08,369 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35:08,378 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35:08,379 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35:08,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 143 [2018-04-13 06:35:08,380 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:35:11,348 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35:11,350 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35:11,350 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35:11,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 147 [2018-04-13 06:35:11,351 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 06:35:12,111 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35:12,112 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35:12,113 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35:12,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 143 [2018-04-13 06:35:12,113 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 06:35:12,859 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35:12,859 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35:12,860 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35:12,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 125 [2018-04-13 06:35:12,861 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-13 06:35:13,593 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35:13,594 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35:13,594 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35:13,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 135 [2018-04-13 06:35:13,595 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-13 06:35:15,104 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35:15,105 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35:15,106 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35:15,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 119 [2018-04-13 06:35:15,107 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-13 06:35:15,841 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35:15,843 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35:15,843 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35:15,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 135 [2018-04-13 06:35:15,844 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-13 06:35:16,558 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35:16,559 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35:16,561 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35:16,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 123 [2018-04-13 06:35:16,561 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-13 06:35:18,693 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35:18,694 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35:18,695 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35:18,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 152 [2018-04-13 06:35:18,696 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-13 06:35:20,085 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35:20,085 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35:20,087 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35:20,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 140 [2018-04-13 06:35:20,087 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-13 06:35:20,884 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35:20,886 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35:20,886 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35:20,887 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 154 [2018-04-13 06:35:20,887 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-13 06:35:21,605 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35:21,605 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35:21,607 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35:21,607 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 127 [2018-04-13 06:35:21,607 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-13 06:35:22,277 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35:22,278 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35:22,279 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35:22,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 121 [2018-04-13 06:35:22,279 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-13 06:35:23,643 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35:23,645 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35:23,646 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35:23,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 135 [2018-04-13 06:35:23,646 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-13 06:35:24,364 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35:24,365 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35:24,366 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35:24,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 133 [2018-04-13 06:35:24,367 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-13 06:35:25,031 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35:25,032 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35:25,034 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35:25,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 117 [2018-04-13 06:35:25,035 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-13 06:35:27,021 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35:27,021 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35:27,023 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35:27,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 123 [2018-04-13 06:35:27,024 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-13 06:35:27,694 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35:27,695 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35:27,696 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35:27,697 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 125 [2018-04-13 06:35:27,697 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-13 06:35:29,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 85 dim-0 vars, 34 dim-1 vars, End of recursive call: 50 dim-0 vars, and 21 xjuncts. [2018-04-13 06:35:29,019 INFO L202 ElimStorePlain]: Needed 22 recursive calls to eliminate 119 variables, input treesize:4719, output treesize:2572 [2018-04-13 06:35:36,995 WARN L151 SmtUtils]: Spent 7667ms on a formula simplification. DAG size of input: 576 DAG size of output 551 [2018-04-13 06:35:40,900 WARN L148 SmtUtils]: Spent 3587ms on a formula simplification that was a NOOP. DAG size: 552 [2018-04-13 06:35:40,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 131 treesize of output 142 [2018-04-13 06:35:40,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 141 [2018-04-13 06:35:40,941 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:35:41,018 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35:41,020 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35:41,031 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 111 treesize of output 144 [2018-04-13 06:35:41,032 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-04-13 06:35:41,114 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-13 06:35:46,524 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35:46,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 144 treesize of output 157 [2018-04-13 06:35:46,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 165 treesize of output 164 [2018-04-13 06:35:46,540 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 06:35:46,631 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35:46,631 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35:46,633 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35:46,634 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35:46,651 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 6 case distinctions, treesize of input 116 treesize of output 157 [2018-04-13 06:35:46,652 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 8 xjuncts. [2018-04-13 06:35:46,790 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-13 06:35:52,558 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35:52,561 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35:52,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 125 treesize of output 144 [2018-04-13 06:35:52,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 159 [2018-04-13 06:35:52,576 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-13 06:35:52,652 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35:52,653 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35:52,654 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35:52,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 103 treesize of output 147 [2018-04-13 06:35:52,676 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 8 xjuncts. [2018-04-13 06:35:52,798 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-13 06:35:58,843 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35:58,846 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35:58,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 146 treesize of output 157 [2018-04-13 06:35:58,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 181 treesize of output 180 [2018-04-13 06:35:58,860 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-13 06:35:58,946 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35:58,948 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:35: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, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 126 treesize of output 159 [2018-04-13 06:35:58,966 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 8 xjuncts. [2018-04-13 06:35:59,126 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-13 06:36:05,871 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:36:05,875 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:36:05,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 148 treesize of output 159 [2018-04-13 06:36:05,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 183 treesize of output 182 [2018-04-13 06:36:05,890 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-13 06:36:06,021 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:36:06,022 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:36:06,025 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:36:06,043 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 6 case distinctions, treesize of input 122 treesize of output 165 [2018-04-13 06:36:06,044 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 8 xjuncts. [2018-04-13 06:36:06,228 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-13 06:36:13,395 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:36:13,401 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:36:13,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 125 treesize of output 170 [2018-04-13 06:36:13,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 170 treesize of output 169 [2018-04-13 06:36:13,425 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-13 06:36:13,678 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:36:13,692 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 4 case distinctions, treesize of input 115 treesize of output 138 [2018-04-13 06:36:13,692 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 4 xjuncts. [2018-04-13 06:36:13,887 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 133 treesize of output 138 [2018-04-13 06:36:13,887 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 2 xjuncts. [2018-04-13 06:36:14,039 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:36:14,040 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:36:14,041 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:36:14,044 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:36:14,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 106 treesize of output 147 [2018-04-13 06:36:14,063 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 8 xjuncts. [2018-04-13 06:36:14,275 INFO L267 ElimStorePlain]: Start of recursive call 17: 4 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-04-13 06:36:21,821 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:36:21,836 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 127 treesize of output 148 [2018-04-13 06:36:21,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 147 [2018-04-13 06:36:21,838 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-13 06:36:21,936 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:36:21,938 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:36:21,951 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 107 treesize of output 140 [2018-04-13 06:36:21,952 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 4 xjuncts. [2018-04-13 06:36:22,045 INFO L267 ElimStorePlain]: Start of recursive call 22: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-13 06:36:30,065 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:36:30,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 139 treesize of output 152 [2018-04-13 06:36:30,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 159 [2018-04-13 06:36:30,088 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-04-13 06:36:30,195 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:36:30,196 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:36:30,197 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:36:30,200 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:36:30,220 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 6 case distinctions, treesize of input 117 treesize of output 158 [2018-04-13 06:36:30,221 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 8 xjuncts. [2018-04-13 06:36:30,379 INFO L267 ElimStorePlain]: Start of recursive call 25: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-13 06:36:37,993 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:36:38,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 129 treesize of output 142 [2018-04-13 06:36:38,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 149 [2018-04-13 06:36:38,008 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-04-13 06:36:38,092 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:36:38,092 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:36:38,093 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:36:38,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 111 treesize of output 155 [2018-04-13 06:36:38,113 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 8 xjuncts. [2018-04-13 06:36:38,238 INFO L267 ElimStorePlain]: Start of recursive call 28: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-13 06:36:45,166 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:36:45,173 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:36:45,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 147 treesize of output 192 [2018-04-13 06:36:45,199 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:36:45,213 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 4 case distinctions, treesize of input 175 treesize of output 198 [2018-04-13 06:36:45,214 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 4 xjuncts. [2018-04-13 06:36:45,518 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 143 [2018-04-13 06:36:45,518 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-04-13 06:36:45,685 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 145 treesize of output 150 [2018-04-13 06:36:45,686 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 2 xjuncts. [2018-04-13 06:36:45,924 INFO L267 ElimStorePlain]: Start of recursive call 31: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-13 06:36:52,480 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:36:52,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 137 treesize of output 150 [2018-04-13 06:36:52,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 157 [2018-04-13 06:36:52,500 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-04-13 06:36:52,592 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:36:52,593 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:36:52,594 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:36:52,596 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:36:52,613 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 6 case distinctions, treesize of input 109 treesize of output 150 [2018-04-13 06:36:52,614 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 8 xjuncts. [2018-04-13 06:36:52,733 INFO L267 ElimStorePlain]: Start of recursive call 35: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-13 06:36:59,236 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:36:59,238 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:36:59,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 119 treesize of output 146 [2018-04-13 06:36:59,251 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 153 [2018-04-13 06:36:59,252 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-04-13 06:36:59,343 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:36:59,345 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:36:59,356 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 115 treesize of output 144 [2018-04-13 06:36:59,356 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 4 xjuncts. [2018-04-13 06:36:59,448 INFO L267 ElimStorePlain]: Start of recursive call 38: 2 dim-1 vars, End of recursive call: and 3 xjuncts. Received shutdown request... [2018-04-13 06:37:03,180 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-04-13 06:37:03,180 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-13 06:37:03,185 WARN L197 ceAbstractionStarter]: Timeout [2018-04-13 06:37:03,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 06:37:03 BoogieIcfgContainer [2018-04-13 06:37:03,185 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-13 06:37:03,186 INFO L168 Benchmark]: Toolchain (without parser) took 842828.59 ms. Allocated memory was 399.5 MB in the beginning and 493.9 MB in the end (delta: 94.4 MB). Free memory was 336.5 MB in the beginning and 380.9 MB in the end (delta: -44.5 MB). Peak memory consumption was 72.4 MB. Max. memory is 5.3 GB. [2018-04-13 06:37:03,187 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 399.5 MB. Free memory is still 362.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-13 06:37:03,187 INFO L168 Benchmark]: CACSL2BoogieTranslator took 266.30 ms. Allocated memory is still 399.5 MB. Free memory was 336.5 MB in the beginning and 309.8 MB in the end (delta: 26.7 MB). Peak memory consumption was 26.7 MB. Max. memory is 5.3 GB. [2018-04-13 06:37:03,187 INFO L168 Benchmark]: Boogie Preprocessor took 42.05 ms. Allocated memory is still 399.5 MB. Free memory was 309.8 MB in the beginning and 307.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-13 06:37:03,188 INFO L168 Benchmark]: RCFGBuilder took 563.59 ms. Allocated memory was 399.5 MB in the beginning and 599.8 MB in the end (delta: 200.3 MB). Free memory was 307.1 MB in the beginning and 499.1 MB in the end (delta: -192.0 MB). Peak memory consumption was 24.3 MB. Max. memory is 5.3 GB. [2018-04-13 06:37:03,188 INFO L168 Benchmark]: TraceAbstraction took 841953.81 ms. Allocated memory was 599.8 MB in the beginning and 493.9 MB in the end (delta: -105.9 MB). Free memory was 499.1 MB in the beginning and 380.9 MB in the end (delta: 118.2 MB). Peak memory consumption was 34.8 MB. Max. memory is 5.3 GB. [2018-04-13 06:37:03,189 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.11 ms. Allocated memory is still 399.5 MB. Free memory is still 362.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 266.30 ms. Allocated memory is still 399.5 MB. Free memory was 336.5 MB in the beginning and 309.8 MB in the end (delta: 26.7 MB). Peak memory consumption was 26.7 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 42.05 ms. Allocated memory is still 399.5 MB. Free memory was 309.8 MB in the beginning and 307.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 563.59 ms. Allocated memory was 399.5 MB in the beginning and 599.8 MB in the end (delta: 200.3 MB). Free memory was 307.1 MB in the beginning and 499.1 MB in the end (delta: -192.0 MB). Peak memory consumption was 24.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 841953.81 ms. Allocated memory was 599.8 MB in the beginning and 493.9 MB in the end (delta: -105.9 MB). Free memory was 499.1 MB in the beginning and 380.9 MB in the end (delta: 118.2 MB). Peak memory consumption was 34.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 698]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 698). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 652]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 694]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 694). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 648]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 718]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 718). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 709]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 709). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 660]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 656]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 656). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 682]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 682). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 642]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 642]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 703]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 703). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 723]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 723). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 718]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 718). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 681]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 681). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 676]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 676). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 719]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 719). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 689]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 689). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 716]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 716). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 677]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 637]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 681]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 681). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 630]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 630). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 668]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 668). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 637]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 642]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 718]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 718). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 689]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 689). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 719]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 719). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 722]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 722). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 682]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 682). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 716]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 716). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 677]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 674]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 674). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 642]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 722]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 722). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 681]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 681). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 720]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 720). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 677]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 648]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 719]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 719). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 689]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 689). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 681]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 681). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 719]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 719). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 722]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 722). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 677]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 642]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 681]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 681). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 722]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 722). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 681]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 681). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 674]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 674). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 635]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 635). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 677]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 719]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 719). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 719]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 719). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 636]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 689]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 689). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 677]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 720]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 720). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 723]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 723). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 665]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 665). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 692]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 692). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 703]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 703). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 642]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 716]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 716). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 660]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 682]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 682). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 648]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 716]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 716). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 676]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 676). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 718]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 718). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 668]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 668). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 682]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 682). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 656]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 656). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 663]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 675]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 675). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 692]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 692). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 705]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 705). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 716]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 716). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 648]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 636]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 698]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 698). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 709]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 709). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 663]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 652]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 635]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 635). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 716]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 716). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 694]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 694). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 665]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 665). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 705]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 705). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - TimeoutResultAtElement [Line: 675]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 675). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 1, 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 885. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 226 locations, 101 error locations. TIMEOUT Result, 841.9s OverallTime, 66 OverallIterations, 2 TraceHistogramMax, 432.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 11862 SDtfs, 45100 SDslu, 42950 SDs, 0 SdLazy, 45943 SolverSat, 2745 SolverUnsat, 98 SolverUnknown, 0 SolverNotchecked, 71.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2234 GetRequests, 1056 SyntacticMatches, 15 SemanticMatches, 1163 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7555 ImplicationChecksByTransitivity, 517.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=860occurred in iteration=65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 65 MinimizatonAttempts, 17631 StatesRemovedByMinimization, 56 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 186.3s InterpolantComputationTime, 4012 NumberOfCodeBlocks, 4012 NumberOfCodeBlocksAsserted, 101 NumberOfCheckSat, 2435 ConstructedInterpolants, 409 QuantifiedInterpolants, 3192960 SizeOfPredicates, 621 NumberOfNonLiveVariables, 6734 ConjunctsInSsa, 1248 ConjunctsInUnsatCore, 65 InterpolantComputations, 51 PerfectInterpolantSequences, 41/93 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/tree_of_cslls_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-13_06-37-03-197.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_of_cslls_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-13_06-37-03-197.csv Completed graceful shutdown