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_cnstr_true-valid-memsafety_false-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-408c70d-m [2018-04-13 06:08:42,994 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-13 06:08:42,995 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-13 06:08:43,007 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-13 06:08:43,007 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-13 06:08:43,007 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-13 06:08:43,008 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-13 06:08:43,009 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-13 06:08:43,011 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-13 06:08:43,011 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-13 06:08:43,012 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-13 06:08:43,012 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-13 06:08:43,013 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-13 06:08:43,014 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-13 06:08:43,015 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-13 06:08:43,016 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-13 06:08:43,018 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-13 06:08:43,019 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-13 06:08:43,020 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-13 06:08:43,021 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-13 06:08:43,023 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-13 06:08:43,023 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-13 06:08:43,023 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-13 06:08:43,024 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-13 06:08:43,025 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-13 06:08:43,025 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-13 06:08:43,026 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-13 06:08:43,026 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-13 06:08:43,026 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-13 06:08:43,027 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-13 06:08:43,027 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-13 06:08:43,027 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:08:43,036 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-13 06:08:43,036 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-13 06:08:43,037 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-13 06:08:43,037 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-13 06:08:43,038 INFO L133 SettingsManager]: * Use SBE=true [2018-04-13 06:08:43,038 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-13 06:08:43,038 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-13 06:08:43,038 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-13 06:08:43,038 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-13 06:08:43,038 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-13 06:08:43,038 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-13 06:08:43,039 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-13 06:08:43,039 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-13 06:08:43,039 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-13 06:08:43,039 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-13 06:08:43,039 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-13 06:08:43,039 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-13 06:08:43,039 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-13 06:08:43,039 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-13 06:08:43,039 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-13 06:08:43,040 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-13 06:08:43,040 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-13 06:08:43,040 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-13 06:08:43,040 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:08:43,070 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-13 06:08:43,081 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-13 06:08:43,084 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-13 06:08:43,086 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-13 06:08:43,086 INFO L276 PluginConnector]: CDTParser initialized [2018-04-13 06:08:43,087 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext/tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,444 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGbcbc15132 [2018-04-13 06:08:43,562 INFO L287 CDTParser]: IsIndexed: true [2018-04-13 06:08:43,562 INFO L288 CDTParser]: Found 1 translation units. [2018-04-13 06:08:43,563 INFO L168 CDTParser]: Scanning tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,569 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-13 06:08:43,569 INFO L215 ultiparseSymbolTable]: [2018-04-13 06:08:43,569 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-13 06:08:43,570 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,570 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-13 06:08:43,570 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__fd_mask in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,570 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__ushort in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,570 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__suseconds_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,570 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____ino_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,570 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____u_quad_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,570 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__pthread_barrier_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,570 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__int64_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,570 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__u_long in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,570 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____WAIT_STATUS in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,570 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____clock_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,570 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__u_int16_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,570 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____blkcnt_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,570 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__pthread_cond_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,570 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__daddr_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,570 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__fsid_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,570 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__quad_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,571 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____u_int in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,571 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____clockid_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,571 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____loff_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,571 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__clockid_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,571 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__u_int8_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,571 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____useconds_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,571 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__pthread_condattr_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,571 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__wchar_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,571 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____uint16_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,571 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____int64_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,571 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____gid_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,571 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____daddr_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,571 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____key_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,571 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____pid_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,571 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____uint8_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,571 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__loff_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,571 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____quad_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,572 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____uint64_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,572 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__ssize_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,572 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__u_quad_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,572 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____swblk_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,572 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____fsblkcnt_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,572 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__register_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,572 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__timer_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,572 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____nlink_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,572 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__pthread_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,572 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__pthread_barrierattr_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,572 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____sig_atomic_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,572 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__pthread_rwlock_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,572 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____fd_mask in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,572 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__pthread_key_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,572 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__u_int32_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,572 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__pthread_rwlockattr_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,572 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____blkcnt64_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,572 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__id_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,572 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__int32_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,573 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__dev_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,573 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__fsfilcnt_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,573 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____off_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,573 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____ino64_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,573 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__sigset_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,573 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____uid_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,573 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__uint in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,573 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__nlink_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,573 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____fsfilcnt_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,573 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__pthread_mutexattr_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,573 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__key_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,573 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__size_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,573 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____timer_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,573 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__u_int in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,573 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____u_short in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,573 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____rlim_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,573 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__pthread_mutex_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,573 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__mode_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,573 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____ssize_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,573 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____intptr_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,574 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____int32_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,574 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____socklen_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,574 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__time_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,574 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____rlim64_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,574 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__ldiv_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,574 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__uid_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,574 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____id_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,574 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__ino_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,574 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____fsfilcnt64_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,574 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__fsblkcnt_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,574 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____blksize_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,574 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__int8_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,574 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____u_char in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,574 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____qaddr_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,575 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____time_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,575 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____off64_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,575 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____suseconds_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,575 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____fsblkcnt64_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,575 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__u_int64_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,575 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__pthread_once_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,575 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__pthread_attr_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,575 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____caddr_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,575 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____int8_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,575 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____dev_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,575 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__u_char in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,575 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____pthread_list_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,576 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__int16_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,576 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__lldiv_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,576 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__off_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,576 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__blkcnt_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,576 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__gid_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,576 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____int16_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,576 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__pid_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,576 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__div_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,576 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__clock_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,576 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____u_long in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,576 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____uint32_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,576 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__fd_set in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,577 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__ulong in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,577 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__pthread_spinlock_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,577 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____mode_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,577 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__blksize_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,577 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__caddr_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,577 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____sigset_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,577 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____fsid_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,577 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__u_short in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:43,612 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGbcbc15132 [2018-04-13 06:08:43,616 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-13 06:08:43,617 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-13 06:08:43,617 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-13 06:08:43,618 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-13 06:08:43,623 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-13 06:08:43,624 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 06:08:43" (1/1) ... [2018-04-13 06:08:43,627 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69401e3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:08:43, skipping insertion in model container [2018-04-13 06:08:43,627 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 06:08:43" (1/1) ... [2018-04-13 06:08:43,641 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-13 06:08:43,664 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-13 06:08:43,776 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-13 06:08:43,815 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-13 06:08:43,821 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 110 non ball SCCs. Number of states in SCCs 110. [2018-04-13 06:08:43,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:08:43 WrapperNode [2018-04-13 06:08:43,849 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-13 06:08:43,849 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-13 06:08:43,850 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-13 06:08:43,850 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-13 06:08:43,858 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:08:43" (1/1) ... [2018-04-13 06:08:43,858 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:08:43" (1/1) ... [2018-04-13 06:08:43,870 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:08:43" (1/1) ... [2018-04-13 06:08:43,870 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:08:43" (1/1) ... [2018-04-13 06:08:43,880 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:08:43" (1/1) ... [2018-04-13 06:08:43,886 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:08:43" (1/1) ... [2018-04-13 06:08:43,888 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:08:43" (1/1) ... [2018-04-13 06:08:43,892 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-13 06:08:43,892 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-13 06:08:43,893 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-13 06:08:43,893 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-13 06:08:43,894 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:08:43" (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:08:43,984 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-13 06:08:43,984 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-13 06:08:43,984 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-13 06:08:43,984 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-13 06:08:43,984 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-13 06:08:43,984 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-13 06:08:43,985 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-13 06:08:43,985 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-13 06:08:43,985 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-13 06:08:43,985 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-13 06:08:43,985 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-13 06:08:43,985 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-13 06:08:43,985 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-13 06:08:43,985 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-13 06:08:43,985 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-13 06:08:43,986 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-13 06:08:43,986 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-13 06:08:43,986 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-13 06:08:43,986 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-13 06:08:43,986 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-13 06:08:43,986 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-13 06:08:43,986 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-13 06:08:43,986 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-13 06:08:43,986 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-13 06:08:43,986 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-13 06:08:43,987 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-13 06:08:43,987 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-13 06:08:43,987 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-13 06:08:43,987 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-13 06:08:43,987 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-13 06:08:43,987 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-13 06:08:43,987 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-13 06:08:43,987 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-13 06:08:43,987 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-13 06:08:43,988 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-13 06:08:43,988 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-13 06:08:43,988 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-13 06:08:43,988 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-13 06:08:43,988 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-13 06:08:43,988 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-13 06:08:43,988 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-13 06:08:43,988 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-13 06:08:43,988 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-13 06:08:43,988 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-13 06:08:43,989 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-13 06:08:43,989 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-13 06:08:43,989 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-13 06:08:43,989 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-13 06:08:43,989 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-13 06:08:43,989 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-13 06:08:43,989 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-13 06:08:43,989 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-13 06:08:43,989 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-13 06:08:43,989 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-13 06:08:43,990 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-13 06:08:43,990 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-13 06:08:43,990 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-13 06:08:43,990 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-13 06:08:43,990 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-13 06:08:43,990 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-13 06:08:43,990 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-13 06:08:43,990 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-13 06:08:43,990 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-13 06:08:43,990 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-13 06:08:43,991 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-13 06:08:43,991 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-13 06:08:43,991 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-13 06:08:43,991 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-13 06:08:43,991 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-13 06:08:43,991 INFO L128 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-04-13 06:08:43,991 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-13 06:08:43,991 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-13 06:08:43,991 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-13 06:08:43,991 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-13 06:08:43,992 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-13 06:08:43,992 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-13 06:08:43,992 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-13 06:08:43,992 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-13 06:08:43,992 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-13 06:08:43,992 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-13 06:08:43,992 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-13 06:08:43,992 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-13 06:08:43,992 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-13 06:08:43,992 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-13 06:08:43,993 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-13 06:08:43,993 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-13 06:08:43,993 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-13 06:08:43,993 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-13 06:08:43,993 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-13 06:08:43,993 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-13 06:08:43,993 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-13 06:08:43,993 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-13 06:08:43,993 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-13 06:08:43,993 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-13 06:08:43,993 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-13 06:08:43,993 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-13 06:08:43,993 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-13 06:08:43,993 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-13 06:08:43,993 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-13 06:08:43,993 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-13 06:08:43,994 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-13 06:08:43,994 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-13 06:08:43,994 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-13 06:08:43,994 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-13 06:08:43,994 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-13 06:08:43,994 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-13 06:08:43,994 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-13 06:08:43,994 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-13 06:08:43,994 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-13 06:08:43,995 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-13 06:08:43,995 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-13 06:08:43,995 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-13 06:08:43,995 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-13 06:08:44,422 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-13 06:08:44,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 06:08:44 BoogieIcfgContainer [2018-04-13 06:08:44,423 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-13 06:08:44,424 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-13 06:08:44,424 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-13 06:08:44,426 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-13 06:08:44,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 06:08:43" (1/3) ... [2018-04-13 06:08:44,427 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67f66307 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 06:08:44, skipping insertion in model container [2018-04-13 06:08:44,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:08:43" (2/3) ... [2018-04-13 06:08:44,428 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67f66307 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 06:08:44, skipping insertion in model container [2018-04-13 06:08:44,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 06:08:44" (3/3) ... [2018-04-13 06:08:44,430 INFO L107 eAbstractionObserver]: Analyzing ICFG tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-13 06:08:44,439 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-13 06:08:44,447 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 55 error locations. [2018-04-13 06:08:44,478 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-13 06:08:44,479 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-13 06:08:44,479 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-13 06:08:44,479 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-13 06:08:44,479 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-13 06:08:44,480 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-13 06:08:44,480 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-13 06:08:44,480 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-13 06:08:44,480 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-13 06:08:44,480 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-13 06:08:44,491 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states. [2018-04-13 06:08:44,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-13 06:08:44,497 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:08:44,497 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:08:44,498 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:08:44,501 INFO L82 PathProgramCache]: Analyzing trace with hash 534396452, now seen corresponding path program 1 times [2018-04-13 06:08:44,502 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:08:44,502 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:08:44,538 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:08:44,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:08:44,538 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:08:44,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:08:44,570 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:08:44,629 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:08:44,631 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:08:44,631 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 06:08:44,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 06:08:44,641 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 06:08:44,642 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 06:08:44,643 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 4 states. [2018-04-13 06:08:44,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:08:44,821 INFO L93 Difference]: Finished difference Result 180 states and 199 transitions. [2018-04-13 06:08:44,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-13 06:08:44,823 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-13 06:08:44,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:08:44,832 INFO L225 Difference]: With dead ends: 180 [2018-04-13 06:08:44,833 INFO L226 Difference]: Without dead ends: 176 [2018-04-13 06:08:44,835 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:08:44,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-04-13 06:08:44,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 127. [2018-04-13 06:08:44,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-04-13 06:08:44,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 140 transitions. [2018-04-13 06:08:44,871 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 140 transitions. Word has length 8 [2018-04-13 06:08:44,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:08:44,871 INFO L459 AbstractCegarLoop]: Abstraction has 127 states and 140 transitions. [2018-04-13 06:08:44,871 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 06:08:44,871 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 140 transitions. [2018-04-13 06:08:44,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-13 06:08:44,872 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:08:44,872 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:08:44,872 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:08:44,872 INFO L82 PathProgramCache]: Analyzing trace with hash 534396453, now seen corresponding path program 1 times [2018-04-13 06:08:44,872 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:08:44,872 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:08:44,873 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:08:44,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:08:44,873 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:08:44,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:08:44,883 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:08:44,922 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:08:44,922 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:08:44,922 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 06:08:44,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 06:08:44,925 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 06:08:44,925 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 06:08:44,925 INFO L87 Difference]: Start difference. First operand 127 states and 140 transitions. Second operand 4 states. [2018-04-13 06:08:45,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:08:45,038 INFO L93 Difference]: Finished difference Result 169 states and 187 transitions. [2018-04-13 06:08:45,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-13 06:08:45,038 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-13 06:08:45,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:08:45,041 INFO L225 Difference]: With dead ends: 169 [2018-04-13 06:08:45,041 INFO L226 Difference]: Without dead ends: 169 [2018-04-13 06:08:45,041 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:08:45,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-04-13 06:08:45,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 125. [2018-04-13 06:08:45,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-04-13 06:08:45,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 138 transitions. [2018-04-13 06:08:45,049 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 138 transitions. Word has length 8 [2018-04-13 06:08:45,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:08:45,050 INFO L459 AbstractCegarLoop]: Abstraction has 125 states and 138 transitions. [2018-04-13 06:08:45,050 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 06:08:45,050 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 138 transitions. [2018-04-13 06:08:45,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-13 06:08:45,050 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:08:45,050 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:08:45,050 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:08:45,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1591612785, now seen corresponding path program 1 times [2018-04-13 06:08:45,051 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:08:45,051 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:08:45,051 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:08:45,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:08:45,052 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:08:45,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:08:45,063 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:08:45,083 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:08:45,083 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:08:45,083 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 06:08:45,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 06:08:45,083 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 06:08:45,083 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 06:08:45,084 INFO L87 Difference]: Start difference. First operand 125 states and 138 transitions. Second operand 4 states. [2018-04-13 06:08:45,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:08:45,201 INFO L93 Difference]: Finished difference Result 158 states and 177 transitions. [2018-04-13 06:08:45,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 06:08:45,201 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-04-13 06:08:45,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:08:45,202 INFO L225 Difference]: With dead ends: 158 [2018-04-13 06:08:45,202 INFO L226 Difference]: Without dead ends: 158 [2018-04-13 06:08:45,202 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:08:45,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-04-13 06:08:45,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 115. [2018-04-13 06:08:45,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-04-13 06:08:45,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 131 transitions. [2018-04-13 06:08:45,206 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 131 transitions. Word has length 14 [2018-04-13 06:08:45,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:08:45,207 INFO L459 AbstractCegarLoop]: Abstraction has 115 states and 131 transitions. [2018-04-13 06:08:45,207 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 06:08:45,207 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 131 transitions. [2018-04-13 06:08:45,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-13 06:08:45,207 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:08:45,207 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:08:45,207 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:08:45,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1591612786, now seen corresponding path program 1 times [2018-04-13 06:08:45,208 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:08:45,208 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:08:45,208 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:08:45,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:08:45,208 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:08:45,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:08:45,216 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:08:45,246 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:08:45,246 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:08:45,246 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 06:08:45,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 06:08:45,247 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 06:08:45,247 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-13 06:08:45,247 INFO L87 Difference]: Start difference. First operand 115 states and 131 transitions. Second operand 5 states. [2018-04-13 06:08:45,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:08:45,438 INFO L93 Difference]: Finished difference Result 241 states and 273 transitions. [2018-04-13 06:08:45,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 06:08:45,438 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-04-13 06:08:45,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:08:45,439 INFO L225 Difference]: With dead ends: 241 [2018-04-13 06:08:45,439 INFO L226 Difference]: Without dead ends: 241 [2018-04-13 06:08:45,439 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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:08:45,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-04-13 06:08:45,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 186. [2018-04-13 06:08:45,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-04-13 06:08:45,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 244 transitions. [2018-04-13 06:08:45,450 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 244 transitions. Word has length 14 [2018-04-13 06:08:45,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:08:45,450 INFO L459 AbstractCegarLoop]: Abstraction has 186 states and 244 transitions. [2018-04-13 06:08:45,450 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 06:08:45,450 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 244 transitions. [2018-04-13 06:08:45,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-13 06:08:45,451 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:08:45,451 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:08:45,451 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:08:45,451 INFO L82 PathProgramCache]: Analyzing trace with hash -655644961, now seen corresponding path program 1 times [2018-04-13 06:08:45,451 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:08:45,451 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:08:45,452 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:08:45,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:08:45,452 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:08:45,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:08:45,461 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:08:45,478 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:08:45,478 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:08:45,478 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 06:08:45,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 06:08:45,478 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 06:08:45,478 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 06:08:45,479 INFO L87 Difference]: Start difference. First operand 186 states and 244 transitions. Second operand 4 states. [2018-04-13 06:08:45,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:08:45,493 INFO L93 Difference]: Finished difference Result 199 states and 242 transitions. [2018-04-13 06:08:45,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-13 06:08:45,494 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-04-13 06:08:45,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:08:45,495 INFO L225 Difference]: With dead ends: 199 [2018-04-13 06:08:45,495 INFO L226 Difference]: Without dead ends: 199 [2018-04-13 06:08:45,495 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:08:45,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-04-13 06:08:45,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 186. [2018-04-13 06:08:45,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-04-13 06:08:45,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 242 transitions. [2018-04-13 06:08:45,503 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 242 transitions. Word has length 17 [2018-04-13 06:08:45,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:08:45,504 INFO L459 AbstractCegarLoop]: Abstraction has 186 states and 242 transitions. [2018-04-13 06:08:45,504 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 06:08:45,504 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 242 transitions. [2018-04-13 06:08:45,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-13 06:08:45,505 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:08:45,505 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:08:45,505 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:08:45,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1393122237, now seen corresponding path program 1 times [2018-04-13 06:08:45,505 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:08:45,505 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:08:45,506 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:08:45,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:08:45,506 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:08:45,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:08:45,517 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:08:45,532 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:08:45,532 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:08:45,532 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 06:08:45,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-13 06:08:45,533 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-13 06:08:45,533 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-13 06:08:45,533 INFO L87 Difference]: Start difference. First operand 186 states and 242 transitions. Second operand 3 states. [2018-04-13 06:08:45,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:08:45,541 INFO L93 Difference]: Finished difference Result 189 states and 245 transitions. [2018-04-13 06:08:45,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-13 06:08:45,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-04-13 06:08:45,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:08:45,542 INFO L225 Difference]: With dead ends: 189 [2018-04-13 06:08:45,542 INFO L226 Difference]: Without dead ends: 189 [2018-04-13 06:08:45,543 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:08:45,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-04-13 06:08:45,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2018-04-13 06:08:45,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-04-13 06:08:45,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 245 transitions. [2018-04-13 06:08:45,548 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 245 transitions. Word has length 22 [2018-04-13 06:08:45,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:08:45,549 INFO L459 AbstractCegarLoop]: Abstraction has 189 states and 245 transitions. [2018-04-13 06:08:45,549 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-13 06:08:45,549 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 245 transitions. [2018-04-13 06:08:45,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-13 06:08:45,549 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:08:45,550 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] [2018-04-13 06:08:45,550 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:08:45,550 INFO L82 PathProgramCache]: Analyzing trace with hash 145884264, now seen corresponding path program 1 times [2018-04-13 06:08:45,550 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:08:45,550 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:08:45,551 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:08:45,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:08:45,551 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:08:45,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:08:45,560 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:08:45,573 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:08:45,573 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:08:45,574 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 06:08:45,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-13 06:08:45,574 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-13 06:08:45,574 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-13 06:08:45,574 INFO L87 Difference]: Start difference. First operand 189 states and 245 transitions. Second operand 3 states. [2018-04-13 06:08:45,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:08:45,582 INFO L93 Difference]: Finished difference Result 191 states and 247 transitions. [2018-04-13 06:08:45,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-13 06:08:45,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-04-13 06:08:45,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:08:45,584 INFO L225 Difference]: With dead ends: 191 [2018-04-13 06:08:45,584 INFO L226 Difference]: Without dead ends: 191 [2018-04-13 06:08:45,584 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:08:45,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-04-13 06:08:45,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-04-13 06:08:45,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-04-13 06:08:45,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 247 transitions. [2018-04-13 06:08:45,590 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 247 transitions. Word has length 22 [2018-04-13 06:08:45,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:08:45,590 INFO L459 AbstractCegarLoop]: Abstraction has 191 states and 247 transitions. [2018-04-13 06:08:45,590 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-13 06:08:45,590 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 247 transitions. [2018-04-13 06:08:45,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-13 06:08:45,591 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:08:45,591 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] [2018-04-13 06:08:45,591 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:08:45,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1289236446, now seen corresponding path program 1 times [2018-04-13 06:08:45,591 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:08:45,592 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:08:45,592 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:08:45,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:08:45,592 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:08:45,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:08:45,601 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:08:45,631 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:08:45,632 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:08:45,632 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 06:08:45,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-13 06:08:45,632 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-13 06:08:45,632 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-13 06:08:45,633 INFO L87 Difference]: Start difference. First operand 191 states and 247 transitions. Second operand 3 states. [2018-04-13 06:08:45,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:08:45,644 INFO L93 Difference]: Finished difference Result 207 states and 257 transitions. [2018-04-13 06:08:45,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-13 06:08:45,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-04-13 06:08:45,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:08:45,645 INFO L225 Difference]: With dead ends: 207 [2018-04-13 06:08:45,645 INFO L226 Difference]: Without dead ends: 207 [2018-04-13 06:08:45,645 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:08:45,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-04-13 06:08:45,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 194. [2018-04-13 06:08:45,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-04-13 06:08:45,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 247 transitions. [2018-04-13 06:08:45,649 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 247 transitions. Word has length 24 [2018-04-13 06:08:45,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:08:45,649 INFO L459 AbstractCegarLoop]: Abstraction has 194 states and 247 transitions. [2018-04-13 06:08:45,650 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-13 06:08:45,650 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 247 transitions. [2018-04-13 06:08:45,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-13 06:08:45,650 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:08:45,650 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] [2018-04-13 06:08:45,650 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:08:45,650 INFO L82 PathProgramCache]: Analyzing trace with hash 527848965, now seen corresponding path program 1 times [2018-04-13 06:08:45,651 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:08:45,651 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:08:45,651 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:08:45,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:08:45,651 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:08:45,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:08:45,662 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:08:45,667 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:08:45,667 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:08:45,667 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:08:45,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:08:45,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:08:45,700 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:08:45,732 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:08:45,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:08:45,735 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:08:45,737 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:08:45,747 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:08:45,749 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:08:45,749 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:08:45,751 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:08:45,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:08:45,755 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2018-04-13 06:08:45,782 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:08:45,784 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:08:45,785 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:08:45,787 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:08:45,791 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:08:45,792 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:08:45,793 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:08:45,793 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:08:45,795 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:08:45,795 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:37, output treesize:7 [2018-04-13 06:08:45,805 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:08:45,806 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:08:45,806 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-13 06:08:45,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-13 06:08:45,806 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-13 06:08:45,806 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-13 06:08:45,807 INFO L87 Difference]: Start difference. First operand 194 states and 247 transitions. Second operand 6 states. [2018-04-13 06:08:45,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:08:45,980 INFO L93 Difference]: Finished difference Result 307 states and 378 transitions. [2018-04-13 06:08:45,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-13 06:08:45,980 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-04-13 06:08:45,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:08:45,981 INFO L225 Difference]: With dead ends: 307 [2018-04-13 06:08:45,981 INFO L226 Difference]: Without dead ends: 307 [2018-04-13 06:08:45,981 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-04-13 06:08:45,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-04-13 06:08:45,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 212. [2018-04-13 06:08:45,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-04-13 06:08:45,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 271 transitions. [2018-04-13 06:08:45,984 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 271 transitions. Word has length 24 [2018-04-13 06:08:45,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:08:45,985 INFO L459 AbstractCegarLoop]: Abstraction has 212 states and 271 transitions. [2018-04-13 06:08:45,985 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-13 06:08:45,985 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 271 transitions. [2018-04-13 06:08:45,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-13 06:08:45,985 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:08:45,985 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:08:45,985 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:08:45,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1108221121, now seen corresponding path program 1 times [2018-04-13 06:08:45,986 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:08:45,986 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:08:45,986 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:08:45,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:08:45,986 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:08:45,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:08:45,995 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:08:46,016 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:08:46,016 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:08:46,016 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 06:08:46,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 06:08:46,016 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 06:08:46,017 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-13 06:08:46,017 INFO L87 Difference]: Start difference. First operand 212 states and 271 transitions. Second operand 5 states. [2018-04-13 06:08:46,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:08:46,170 INFO L93 Difference]: Finished difference Result 339 states and 423 transitions. [2018-04-13 06:08:46,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 06:08:46,170 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-04-13 06:08:46,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:08:46,172 INFO L225 Difference]: With dead ends: 339 [2018-04-13 06:08:46,172 INFO L226 Difference]: Without dead ends: 339 [2018-04-13 06:08:46,172 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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:08:46,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-04-13 06:08:46,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 211. [2018-04-13 06:08:46,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-04-13 06:08:46,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 269 transitions. [2018-04-13 06:08:46,177 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 269 transitions. Word has length 25 [2018-04-13 06:08:46,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:08:46,178 INFO L459 AbstractCegarLoop]: Abstraction has 211 states and 269 transitions. [2018-04-13 06:08:46,178 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 06:08:46,178 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 269 transitions. [2018-04-13 06:08:46,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-13 06:08:46,178 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:08:46,180 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:08:46,180 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:08:46,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1108221120, now seen corresponding path program 1 times [2018-04-13 06:08:46,181 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:08:46,181 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:08:46,181 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:08:46,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:08:46,182 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:08:46,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:08:46,190 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:08:46,232 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:08:46,232 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:08:46,232 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 06:08:46,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 06:08:46,232 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 06:08:46,233 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-13 06:08:46,233 INFO L87 Difference]: Start difference. First operand 211 states and 269 transitions. Second operand 5 states. [2018-04-13 06:08:46,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:08:46,417 INFO L93 Difference]: Finished difference Result 374 states and 480 transitions. [2018-04-13 06:08:46,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 06:08:46,417 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-04-13 06:08:46,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:08:46,418 INFO L225 Difference]: With dead ends: 374 [2018-04-13 06:08:46,418 INFO L226 Difference]: Without dead ends: 374 [2018-04-13 06:08:46,419 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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:08:46,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2018-04-13 06:08:46,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 210. [2018-04-13 06:08:46,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-04-13 06:08:46,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 267 transitions. [2018-04-13 06:08:46,422 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 267 transitions. Word has length 25 [2018-04-13 06:08:46,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:08:46,422 INFO L459 AbstractCegarLoop]: Abstraction has 210 states and 267 transitions. [2018-04-13 06:08:46,422 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 06:08:46,422 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 267 transitions. [2018-04-13 06:08:46,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-13 06:08:46,423 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:08:46,423 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:08:46,423 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:08:46,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1869347276, now seen corresponding path program 1 times [2018-04-13 06:08:46,423 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:08:46,423 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:08:46,424 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:08:46,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:08:46,424 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:08:46,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:08:46,429 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:08:46,464 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:08:46,465 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:08:46,465 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-13 06:08:46,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-13 06:08:46,465 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-13 06:08:46,465 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-13 06:08:46,465 INFO L87 Difference]: Start difference. First operand 210 states and 267 transitions. Second operand 6 states. [2018-04-13 06:08:46,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:08:46,579 INFO L93 Difference]: Finished difference Result 223 states and 282 transitions. [2018-04-13 06:08:46,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-13 06:08:46,579 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-04-13 06:08:46,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:08:46,580 INFO L225 Difference]: With dead ends: 223 [2018-04-13 06:08:46,580 INFO L226 Difference]: Without dead ends: 223 [2018-04-13 06:08:46,581 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:08:46,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-04-13 06:08:46,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 216. [2018-04-13 06:08:46,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-04-13 06:08:46,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 275 transitions. [2018-04-13 06:08:46,585 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 275 transitions. Word has length 26 [2018-04-13 06:08:46,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:08:46,585 INFO L459 AbstractCegarLoop]: Abstraction has 216 states and 275 transitions. [2018-04-13 06:08:46,585 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-13 06:08:46,585 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 275 transitions. [2018-04-13 06:08:46,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-13 06:08:46,586 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:08:46,586 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:08:46,586 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:08:46,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1875072914, now seen corresponding path program 1 times [2018-04-13 06:08:46,587 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:08:46,587 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:08:46,587 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:08:46,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:08:46,588 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:08:46,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:08:46,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:08:46,595 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:08:46,595 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:08:46,595 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:08:46,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:08:46,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:08:46,613 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:08:46,622 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:08:46,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:08:46,624 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:08:46,625 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:08:46,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-13 06:08:46,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 06:08:46,633 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:08:46,634 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:08:46,638 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:08:46,639 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2018-04-13 06:08:46,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:08:46,651 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:08:46,652 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:08:46,653 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:08:46,658 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:08:46,667 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:08:46,669 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:08:46,670 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:08:46,670 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:08:46,673 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:08:46,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:08:46,681 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-04-13 06:08:46,720 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:08:46,723 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:08:46,724 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:08:46,725 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:08:46,725 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:08:46,728 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:08:46,736 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:08:46,739 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:08:46,739 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:08:46,739 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:08:46,740 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:08:46,742 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:08:46,747 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:08:46,747 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:59, output treesize:7 [2018-04-13 06:08:46,774 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:08:46,774 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:08:46,774 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-13 06:08:46,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-13 06:08:46,775 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-13 06:08:46,775 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-04-13 06:08:46,775 INFO L87 Difference]: Start difference. First operand 216 states and 275 transitions. Second operand 9 states. [2018-04-13 06:08:47,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:08:47,173 INFO L93 Difference]: Finished difference Result 291 states and 359 transitions. [2018-04-13 06:08:47,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-13 06:08:47,173 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-04-13 06:08:47,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:08:47,174 INFO L225 Difference]: With dead ends: 291 [2018-04-13 06:08:47,174 INFO L226 Difference]: Without dead ends: 291 [2018-04-13 06:08:47,174 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2018-04-13 06:08:47,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-04-13 06:08:47,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 258. [2018-04-13 06:08:47,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-04-13 06:08:47,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 339 transitions. [2018-04-13 06:08:47,179 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 339 transitions. Word has length 26 [2018-04-13 06:08:47,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:08:47,179 INFO L459 AbstractCegarLoop]: Abstraction has 258 states and 339 transitions. [2018-04-13 06:08:47,179 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-13 06:08:47,179 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 339 transitions. [2018-04-13 06:08:47,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-13 06:08:47,180 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:08:47,180 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:08:47,180 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:08:47,180 INFO L82 PathProgramCache]: Analyzing trace with hash 121654351, now seen corresponding path program 1 times [2018-04-13 06:08:47,181 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:08:47,181 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:08:47,181 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:08:47,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:08:47,181 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:08:47,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:08:47,188 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:08:47,234 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:08:47,234 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:08:47,234 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-13 06:08:47,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-13 06:08:47,234 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-13 06:08:47,234 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-13 06:08:47,234 INFO L87 Difference]: Start difference. First operand 258 states and 339 transitions. Second operand 6 states. [2018-04-13 06:08:47,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:08:47,400 INFO L93 Difference]: Finished difference Result 261 states and 324 transitions. [2018-04-13 06:08:47,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-13 06:08:47,403 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-04-13 06:08:47,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:08:47,404 INFO L225 Difference]: With dead ends: 261 [2018-04-13 06:08:47,404 INFO L226 Difference]: Without dead ends: 261 [2018-04-13 06:08:47,404 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-04-13 06:08:47,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-04-13 06:08:47,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 226. [2018-04-13 06:08:47,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-04-13 06:08:47,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 285 transitions. [2018-04-13 06:08:47,408 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 285 transitions. Word has length 28 [2018-04-13 06:08:47,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:08:47,409 INFO L459 AbstractCegarLoop]: Abstraction has 226 states and 285 transitions. [2018-04-13 06:08:47,409 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-13 06:08:47,409 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 285 transitions. [2018-04-13 06:08:47,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-13 06:08:47,409 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:08:47,409 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:08:47,409 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:08:47,410 INFO L82 PathProgramCache]: Analyzing trace with hash 398243291, now seen corresponding path program 1 times [2018-04-13 06:08:47,410 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:08:47,410 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:08:47,410 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:08:47,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:08:47,411 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:08:47,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:08:47,418 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:08:47,420 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:08:47,420 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:08:47,420 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:08:47,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:08:47,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:08:47,446 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:08:47,454 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:08:47,455 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:08:47,455 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:08:47,456 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:08:47,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:08:47,461 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-04-13 06:08:47,473 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:08:47,475 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:08:47,475 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:08:47,476 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:08:47,482 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:08:47,482 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2018-04-13 06:08:47,502 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 37 treesize of output 33 [2018-04-13 06:08:47,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:08:47,504 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:08:47,506 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:08:47,511 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:08:47,511 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2018-04-13 06:08:47,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2018-04-13 06:08:47,535 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 19 treesize of output 10 [2018-04-13 06:08:47,535 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:08:47,541 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:08:47,541 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:08:47,544 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:08:47,549 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:08:47,549 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:41, output treesize:15 [2018-04-13 06:08:47,561 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:08:47,561 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:08:47,561 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-13 06:08:47,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-13 06:08:47,562 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-13 06:08:47,562 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-04-13 06:08:47,562 INFO L87 Difference]: Start difference. First operand 226 states and 285 transitions. Second operand 8 states. [2018-04-13 06:08:47,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:08:47,827 INFO L93 Difference]: Finished difference Result 263 states and 329 transitions. [2018-04-13 06:08:47,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-13 06:08:47,827 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-04-13 06:08:47,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:08:47,828 INFO L225 Difference]: With dead ends: 263 [2018-04-13 06:08:47,828 INFO L226 Difference]: Without dead ends: 263 [2018-04-13 06:08:47,829 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-04-13 06:08:47,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-04-13 06:08:47,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 225. [2018-04-13 06:08:47,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-04-13 06:08:47,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 283 transitions. [2018-04-13 06:08:47,831 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 283 transitions. Word has length 28 [2018-04-13 06:08:47,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:08:47,831 INFO L459 AbstractCegarLoop]: Abstraction has 225 states and 283 transitions. [2018-04-13 06:08:47,831 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-13 06:08:47,831 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 283 transitions. [2018-04-13 06:08:47,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-13 06:08:47,832 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:08:47,832 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:08:47,832 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:08:47,832 INFO L82 PathProgramCache]: Analyzing trace with hash 398243292, now seen corresponding path program 1 times [2018-04-13 06:08:47,832 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:08:47,832 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:08:47,833 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:08:47,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:08:47,833 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:08:47,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:08:47,838 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:08:47,839 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:08:47,839 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:08:47,840 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:08:47,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:08:47,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:08:47,854 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:08:47,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 06:08:47,883 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:08:47,888 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:08:47,888 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:08:47,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-04-13 06:08:47,889 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:08:47,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:08:47,892 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-13 06:08:47,901 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:08:47,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 06:08:47,909 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:08:47,910 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:08:47,916 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:08:47,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:08:47,918 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:08:47,920 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:08:47,926 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:08:47,927 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:25 [2018-04-13 06:08:47,955 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 52 [2018-04-13 06:08:47,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:08:47,958 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:08:47,965 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:08:47,978 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 27 treesize of output 28 [2018-04-13 06:08:47,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-13 06:08:47,980 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:08:47,983 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:08:47,989 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:08:47,989 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:63, output treesize:47 [2018-04-13 06:08:48,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 33 [2018-04-13 06:08:48,009 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:08:48,009 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:08:48,043 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 28 treesize of output 17 [2018-04-13 06:08:48,043 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:08:48,056 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:08:48,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-04-13 06:08:48,064 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:08:48,064 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 06:08:48,070 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:08:48,071 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 06:08:48,072 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:08:48,074 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:08:48,075 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:61, output treesize:9 [2018-04-13 06:08:48,081 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:08:48,081 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:08:48,081 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-13 06:08:48,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-13 06:08:48,081 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-13 06:08:48,082 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-13 06:08:48,082 INFO L87 Difference]: Start difference. First operand 225 states and 283 transitions. Second operand 8 states. [2018-04-13 06:08:48,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:08:48,318 INFO L93 Difference]: Finished difference Result 262 states and 327 transitions. [2018-04-13 06:08:48,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-13 06:08:48,319 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-04-13 06:08:48,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:08:48,319 INFO L225 Difference]: With dead ends: 262 [2018-04-13 06:08:48,319 INFO L226 Difference]: Without dead ends: 262 [2018-04-13 06:08:48,320 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2018-04-13 06:08:48,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-04-13 06:08:48,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 224. [2018-04-13 06:08:48,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-04-13 06:08:48,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 281 transitions. [2018-04-13 06:08:48,322 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 281 transitions. Word has length 28 [2018-04-13 06:08:48,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:08:48,322 INFO L459 AbstractCegarLoop]: Abstraction has 224 states and 281 transitions. [2018-04-13 06:08:48,322 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-13 06:08:48,322 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 281 transitions. [2018-04-13 06:08:48,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-13 06:08:48,323 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:08:48,323 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:08:48,323 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:08:48,323 INFO L82 PathProgramCache]: Analyzing trace with hash -468463012, now seen corresponding path program 1 times [2018-04-13 06:08:48,323 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:08:48,323 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:08:48,323 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:08:48,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:08:48,324 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:08:48,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:08:48,333 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:08:48,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 06:08:48,347 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:08:48,347 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 06:08:48,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 06:08:48,347 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 06:08:48,347 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-13 06:08:48,347 INFO L87 Difference]: Start difference. First operand 224 states and 281 transitions. Second operand 5 states. [2018-04-13 06:08:48,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:08:48,515 INFO L93 Difference]: Finished difference Result 353 states and 434 transitions. [2018-04-13 06:08:48,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 06:08:48,516 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-04-13 06:08:48,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:08:48,517 INFO L225 Difference]: With dead ends: 353 [2018-04-13 06:08:48,517 INFO L226 Difference]: Without dead ends: 353 [2018-04-13 06:08:48,517 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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:08:48,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2018-04-13 06:08:48,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 223. [2018-04-13 06:08:48,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-04-13 06:08:48,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 279 transitions. [2018-04-13 06:08:48,519 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 279 transitions. Word has length 29 [2018-04-13 06:08:48,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:08:48,519 INFO L459 AbstractCegarLoop]: Abstraction has 223 states and 279 transitions. [2018-04-13 06:08:48,520 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 06:08:48,520 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 279 transitions. [2018-04-13 06:08:48,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-13 06:08:48,520 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:08:48,520 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:08:48,520 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:08:48,520 INFO L82 PathProgramCache]: Analyzing trace with hash -468463011, now seen corresponding path program 1 times [2018-04-13 06:08:48,520 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:08:48,520 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:08:48,521 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:08:48,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:08:48,521 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:08:48,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:08:48,526 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:08:48,548 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:08:48,548 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:08:48,548 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 06:08:48,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 06:08:48,548 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 06:08:48,548 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-13 06:08:48,548 INFO L87 Difference]: Start difference. First operand 223 states and 279 transitions. Second operand 5 states. [2018-04-13 06:08:48,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:08:48,724 INFO L93 Difference]: Finished difference Result 390 states and 494 transitions. [2018-04-13 06:08:48,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 06:08:48,725 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-04-13 06:08:48,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:08:48,726 INFO L225 Difference]: With dead ends: 390 [2018-04-13 06:08:48,726 INFO L226 Difference]: Without dead ends: 390 [2018-04-13 06:08:48,726 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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:08:48,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2018-04-13 06:08:48,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 222. [2018-04-13 06:08:48,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-04-13 06:08:48,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 277 transitions. [2018-04-13 06:08:48,730 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 277 transitions. Word has length 29 [2018-04-13 06:08:48,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:08:48,731 INFO L459 AbstractCegarLoop]: Abstraction has 222 states and 277 transitions. [2018-04-13 06:08:48,731 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 06:08:48,731 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 277 transitions. [2018-04-13 06:08:48,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-13 06:08:48,731 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:08:48,731 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] [2018-04-13 06:08:48,731 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:08:48,731 INFO L82 PathProgramCache]: Analyzing trace with hash -2092835834, now seen corresponding path program 1 times [2018-04-13 06:08:48,732 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:08:48,732 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:08:48,732 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:08:48,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:08:48,732 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:08:48,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:08:48,738 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:08:48,739 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:08:48,739 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:08:48,739 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:08:48,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:08:48,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:08:48,751 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:08:48,773 WARN L1033 $PredicateComparison]: unable to prove that (exists ((main_~n~0.base Int)) (and (= (store |c_old(#valid)| main_~n~0.base 0) |c_#valid|) (= (select |c_old(#valid)| main_~n~0.base) 0))) is different from true [2018-04-13 06:08:48,777 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:08:48,777 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 06:08:48,777 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-04-13 06:08:48,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-13 06:08:48,777 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-13 06:08:48,777 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=22, Unknown=1, NotChecked=8, Total=42 [2018-04-13 06:08:48,777 INFO L87 Difference]: Start difference. First operand 222 states and 277 transitions. Second operand 7 states. [2018-04-13 06:08:48,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:08:48,907 INFO L93 Difference]: Finished difference Result 281 states and 348 transitions. [2018-04-13 06:08:48,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-13 06:08:48,907 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-04-13 06:08:48,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:08:48,908 INFO L225 Difference]: With dead ends: 281 [2018-04-13 06:08:48,908 INFO L226 Difference]: Without dead ends: 279 [2018-04-13 06:08:48,908 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=63, Unknown=2, NotChecked=16, Total=110 [2018-04-13 06:08:48,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-04-13 06:08:48,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 228. [2018-04-13 06:08:48,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-04-13 06:08:48,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 283 transitions. [2018-04-13 06:08:48,912 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 283 transitions. Word has length 30 [2018-04-13 06:08:48,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:08:48,912 INFO L459 AbstractCegarLoop]: Abstraction has 228 states and 283 transitions. [2018-04-13 06:08:48,913 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-13 06:08:48,913 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 283 transitions. [2018-04-13 06:08:48,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-13 06:08:48,913 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:08:48,913 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:08:48,913 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:08:48,913 INFO L82 PathProgramCache]: Analyzing trace with hash -2092836151, now seen corresponding path program 1 times [2018-04-13 06:08:48,913 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:08:48,914 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:08:48,914 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:08:48,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:08:48,914 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:08:48,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:08:48,919 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:08:48,944 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:08:48,944 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:08:48,944 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 06:08:48,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-13 06:08:48,945 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-13 06:08:48,945 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-13 06:08:48,945 INFO L87 Difference]: Start difference. First operand 228 states and 283 transitions. Second operand 3 states. [2018-04-13 06:08:48,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:08:48,952 INFO L93 Difference]: Finished difference Result 200 states and 229 transitions. [2018-04-13 06:08:48,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-13 06:08:48,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-04-13 06:08:48,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:08:48,953 INFO L225 Difference]: With dead ends: 200 [2018-04-13 06:08:48,953 INFO L226 Difference]: Without dead ends: 184 [2018-04-13 06:08:48,954 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:08:48,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-04-13 06:08:48,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 183. [2018-04-13 06:08:48,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-04-13 06:08:48,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 213 transitions. [2018-04-13 06:08:48,956 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 213 transitions. Word has length 30 [2018-04-13 06:08:48,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:08:48,957 INFO L459 AbstractCegarLoop]: Abstraction has 183 states and 213 transitions. [2018-04-13 06:08:48,957 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-13 06:08:48,957 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 213 transitions. [2018-04-13 06:08:48,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-13 06:08:48,957 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:08:48,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] [2018-04-13 06:08:48,957 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:08:48,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1632757376, now seen corresponding path program 1 times [2018-04-13 06:08:48,958 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:08:48,958 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:08:48,958 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:08:48,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:08:48,959 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:08:48,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:08:48,967 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:08:48,968 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:08:48,969 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:08:48,969 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:08:48,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:08:48,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:08:48,991 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:08:49,000 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:08:49,001 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:08:49,002 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:08:49,002 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:08:49,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:08:49,007 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-04-13 06:08:49,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-13 06:08:49,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:08:49,019 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:08:49,021 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:08:49,026 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:08:49,027 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:27 [2018-04-13 06:08:49,051 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:08:49,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-13 06:08:49,053 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:08:49,059 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:08:49,066 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:08:49,066 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:40 [2018-04-13 06:08:49,086 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 44 treesize of output 30 [2018-04-13 06:08:49,088 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:08:49,088 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:08:49,094 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:08:49,094 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:08:49,097 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:08:49,101 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:08:49,102 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:49, output treesize:15 [2018-04-13 06:08:49,112 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:08:49,112 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:08:49,112 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-13 06:08:49,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-13 06:08:49,113 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-13 06:08:49,113 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-04-13 06:08:49,113 INFO L87 Difference]: Start difference. First operand 183 states and 213 transitions. Second operand 8 states. [2018-04-13 06:08:49,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:08:49,292 INFO L93 Difference]: Finished difference Result 189 states and 220 transitions. [2018-04-13 06:08:49,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-13 06:08:49,292 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-04-13 06:08:49,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:08:49,293 INFO L225 Difference]: With dead ends: 189 [2018-04-13 06:08:49,293 INFO L226 Difference]: Without dead ends: 189 [2018-04-13 06:08:49,293 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-04-13 06:08:49,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-04-13 06:08:49,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 182. [2018-04-13 06:08:49,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-04-13 06:08:49,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 212 transitions. [2018-04-13 06:08:49,295 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 212 transitions. Word has length 32 [2018-04-13 06:08:49,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:08:49,295 INFO L459 AbstractCegarLoop]: Abstraction has 182 states and 212 transitions. [2018-04-13 06:08:49,295 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-13 06:08:49,295 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 212 transitions. [2018-04-13 06:08:49,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-13 06:08:49,296 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:08:49,296 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:08:49,296 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:08:49,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1632757375, now seen corresponding path program 1 times [2018-04-13 06:08:49,296 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:08:49,296 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:08:49,296 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:08:49,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:08:49,297 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:08:49,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:08:49,303 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:08:49,305 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:08:49,305 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:08:49,305 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:08:49,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:08:49,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:08:49,321 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:08:49,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 06:08:49,352 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:08:49,358 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:08:49,358 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:08:49,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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:08:49,359 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:08:49,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:08:49,363 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2018-04-13 06:08:49,371 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:08:49,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:08:49,373 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:08:49,374 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:08:49,381 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:08:49,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:08:49,383 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:08:49,384 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:08:49,389 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:08:49,389 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:39, output treesize:34 [2018-04-13 06:08:49,409 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 11 treesize of output 1 [2018-04-13 06:08:49,409 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:08:49,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 62 [2018-04-13 06:08:49,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:08:49,424 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:08:49,429 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:08:49,442 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:08:49,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:08:49,444 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 06:08:49,448 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:08:49,456 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:08:49,457 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:100, output treesize:69 [2018-04-13 06:08:49,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 41 [2018-04-13 06:08:49,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 17 [2018-04-13 06:08:49,493 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:08:49,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-13 06:08:49,500 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:08:49,503 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:08:49,512 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 35 treesize of output 31 [2018-04-13 06:08:49,515 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:08:49,515 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 06:08:49,520 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:08:49,520 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 06:08:49,522 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:08:49,528 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:08:49,528 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:87, output treesize:9 [2018-04-13 06:08:49,535 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:08:49,535 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:08:49,535 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-13 06:08:49,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-13 06:08:49,536 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-13 06:08:49,536 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-13 06:08:49,536 INFO L87 Difference]: Start difference. First operand 182 states and 212 transitions. Second operand 8 states. [2018-04-13 06:08:49,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:08:49,745 INFO L93 Difference]: Finished difference Result 188 states and 219 transitions. [2018-04-13 06:08:49,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-13 06:08:49,747 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-04-13 06:08:49,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:08:49,747 INFO L225 Difference]: With dead ends: 188 [2018-04-13 06:08:49,747 INFO L226 Difference]: Without dead ends: 188 [2018-04-13 06:08:49,748 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2018-04-13 06:08:49,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-04-13 06:08:49,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 181. [2018-04-13 06:08:49,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-04-13 06:08:49,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 211 transitions. [2018-04-13 06:08:49,749 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 211 transitions. Word has length 32 [2018-04-13 06:08:49,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:08:49,750 INFO L459 AbstractCegarLoop]: Abstraction has 181 states and 211 transitions. [2018-04-13 06:08:49,750 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-13 06:08:49,750 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 211 transitions. [2018-04-13 06:08:49,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-13 06:08:49,750 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:08:49,750 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:08:49,750 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:08:49,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1370981878, now seen corresponding path program 1 times [2018-04-13 06:08:49,751 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:08:49,751 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:08:49,751 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:08:49,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:08:49,751 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:08:49,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:08:49,763 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:08:49,921 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 06:08:49,922 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:08:49,922 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:08:49,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:08:49,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:08:49,956 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:08:50,006 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:08:50,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, 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:08:50,008 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:08:50,009 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:08:50,013 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:08:50,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-13 06:08:50,014 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:08:50,015 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:08:50,017 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:08:50,018 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-04-13 06:08:50,039 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 06:08:50,039 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 06:08:50,039 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2018-04-13 06:08:50,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-13 06:08:50,040 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-13 06:08:50,040 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-04-13 06:08:50,040 INFO L87 Difference]: Start difference. First operand 181 states and 211 transitions. Second operand 14 states. [2018-04-13 06:08:50,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:08:50,529 INFO L93 Difference]: Finished difference Result 297 states and 340 transitions. [2018-04-13 06:08:50,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-13 06:08:50,529 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 48 [2018-04-13 06:08:50,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:08:50,530 INFO L225 Difference]: With dead ends: 297 [2018-04-13 06:08:50,530 INFO L226 Difference]: Without dead ends: 297 [2018-04-13 06:08:50,530 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 41 SyntacticMatches, 6 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=203, Invalid=609, Unknown=0, NotChecked=0, Total=812 [2018-04-13 06:08:50,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-04-13 06:08:50,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 207. [2018-04-13 06:08:50,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-04-13 06:08:50,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 241 transitions. [2018-04-13 06:08:50,534 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 241 transitions. Word has length 48 [2018-04-13 06:08:50,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:08:50,534 INFO L459 AbstractCegarLoop]: Abstraction has 207 states and 241 transitions. [2018-04-13 06:08:50,534 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-13 06:08:50,534 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 241 transitions. [2018-04-13 06:08:50,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-13 06:08:50,534 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:08:50,534 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:08:50,534 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:08:50,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1056039926, now seen corresponding path program 1 times [2018-04-13 06:08:50,535 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:08:50,535 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:08:50,535 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:08:50,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:08:50,536 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:08:50,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:08:50,544 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:08:50,547 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:08:50,548 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:08:50,548 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:08:50,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:08:50,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:08:50,568 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:08:50,592 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:08:50,593 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:08:50,593 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:08:50,594 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:08:50,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:08:50,600 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-04-13 06:08:50,612 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:08:50,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:08:50,614 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:08:50,616 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:08:50,625 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:08:50,625 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:33 [2018-04-13 06:08:50,654 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:08:50,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 52 [2018-04-13 06:08:50,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:08:50,663 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:08:50,669 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:08:50,677 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:08:50,678 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:46 [2018-04-13 06:08:50,719 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 46 [2018-04-13 06:08:50,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 29 [2018-04-13 06:08:50,722 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:08:50,728 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:08:50,736 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:08:50,736 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:55 [2018-04-13 06:08:56,774 WARN L151 SmtUtils]: Spent 2026ms on a formula simplification. DAG size of input: 27 DAG size of output 23 [2018-04-13 06:08:58,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 32 [2018-04-13 06:08:58,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-13 06:08:58,816 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:08:58,821 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:08:58,821 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:08:58,823 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:08:58,827 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:08:58,827 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:51, output treesize:15 [2018-04-13 06:08:58,942 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 06:08:58,942 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 06:08:58,942 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-13 06:08:58,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-13 06:08:58,943 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-13 06:08:58,943 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=114, Unknown=3, NotChecked=0, Total=156 [2018-04-13 06:08:58,943 INFO L87 Difference]: Start difference. First operand 207 states and 241 transitions. Second operand 13 states. [2018-04-13 06:09:27,390 WARN L151 SmtUtils]: Spent 2024ms on a formula simplification. DAG size of input: 60 DAG size of output 37 [2018-04-13 06:09:46,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:09:46,030 INFO L93 Difference]: Finished difference Result 567 states and 674 transitions. [2018-04-13 06:09:46,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-13 06:09:46,032 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48 [2018-04-13 06:09:46,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:09:46,034 INFO L225 Difference]: With dead ends: 567 [2018-04-13 06:09:46,034 INFO L226 Difference]: Without dead ends: 567 [2018-04-13 06:09:46,034 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 42.6s TimeCoverageRelationStatistics Valid=180, Invalid=401, Unknown=19, NotChecked=0, Total=600 [2018-04-13 06:09:46,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2018-04-13 06:09:46,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 255. [2018-04-13 06:09:46,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-04-13 06:09:46,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 312 transitions. [2018-04-13 06:09:46,039 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 312 transitions. Word has length 48 [2018-04-13 06:09:46,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:09:46,040 INFO L459 AbstractCegarLoop]: Abstraction has 255 states and 312 transitions. [2018-04-13 06:09:46,040 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-13 06:09:46,040 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 312 transitions. [2018-04-13 06:09:46,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-13 06:09:46,040 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:09:46,040 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:09:46,040 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:09:46,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1056039925, now seen corresponding path program 1 times [2018-04-13 06:09:46,041 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:09:46,041 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:09:46,041 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:09:46,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:09:46,042 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:09:46,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:09:46,053 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:09:46,057 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:09:46,057 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:09:46,057 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:09:46,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:09:46,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:09:46,089 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:09:46,099 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:09:46,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:09:46,101 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:09:46,103 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:09:46,110 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:09:46,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:09:46,112 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:09:46,126 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:09:46,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:09:46,132 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2018-04-13 06:09:46,145 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:09:46,153 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:09:46,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, 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:09:46,155 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:09:46,159 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:09:46,171 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:09:46,173 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:09:46,174 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:09:46,174 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:09:46,178 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:09:46,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:09:46,185 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-04-13 06:09:46,267 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:09:46,268 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:09:46,268 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:09:46,269 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:09:46,280 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:09:46,280 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:71, output treesize:69 [2018-04-13 06:09:46,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2018-04-13 06:09:46,302 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:09:46,321 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 31 [2018-04-13 06:09:46,323 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:09:46,324 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:09:46,325 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:09:46,332 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 2 case distinctions, treesize of input 28 treesize of output 59 [2018-04-13 06:09:46,333 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-13 06:09:46,351 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 06:09:46,375 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 26 [2018-04-13 06:09:46,377 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:09:46,377 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:09:46,383 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 23 treesize of output 46 [2018-04-13 06:09:46,383 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-13 06:09:46,395 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 06:09:46,418 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 4 xjuncts. [2018-04-13 06:09:46,418 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:100, output treesize:256 [2018-04-13 06:09:46,519 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:09:46,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 98 [2018-04-13 06:09:46,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-13 06:09:46,526 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:09:46,542 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:09:46,598 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 94 treesize of output 85 [2018-04-13 06:09:46,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 14 treesize of output 13 [2018-04-13 06:09:46,629 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:09:46,643 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:09:46,685 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:09:46,689 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 123 [2018-04-13 06:09:46,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:09:46,691 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 06:09:46,707 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:09:46,756 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 119 treesize of output 110 [2018-04-13 06:09:46,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:09:46,758 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-13 06:09:46,776 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:09:46,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 06:09:46,815 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:234, output treesize:194 [2018-04-13 06:09:46,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 142 [2018-04-13 06:09:46,923 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 22 treesize of output 29 [2018-04-13 06:09:46,923 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:09:46,954 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:09:47,010 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 128 treesize of output 114 [2018-04-13 06:09:47,014 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 22 treesize of output 29 [2018-04-13 06:09:47,014 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:09:47,028 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:09:47,079 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 146 treesize of output 129 [2018-04-13 06:09:47,081 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 22 treesize of output 29 [2018-04-13 06:09:47,081 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 06:09:47,100 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:09:47,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 101 [2018-04-13 06:09:47,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, 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 29 [2018-04-13 06:09:47,148 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-13 06:09:47,162 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:09:47,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 4 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-04-13 06:09:47,198 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 9 variables, input treesize:285, output treesize:245 [2018-04-13 06:09:47,489 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 98 treesize of output 89 [2018-04-13 06:09:47,491 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:09:47,492 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:09:47,495 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 30 treesize of output 30 [2018-04-13 06:09:47,495 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:09:47,512 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:09:47,512 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:09:47,523 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:09:47,569 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 153 treesize of output 132 [2018-04-13 06:09:47,572 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 1 [2018-04-13 06:09:47,573 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 06:09:47,606 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:09:47,607 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:09:47,608 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:09:47,608 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:09:47,609 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:09:47,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 63 [2018-04-13 06:09:47,615 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-13 06:09:47,678 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-13 06:09:47,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 49 [2018-04-13 06:09:47,756 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:09:47,756 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-13 06:09:47,767 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:09:47,768 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:09:47,768 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:09:47,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2018-04-13 06:09:47,769 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-13 06:09:47,776 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:09:47,827 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 87 treesize of output 71 [2018-04-13 06:09:47,829 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 1 [2018-04-13 06:09:47,830 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-13 06:09:47,843 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:09:47,846 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:09:47,846 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:09:47,847 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:09:47,847 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:09:47,847 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:09:47,848 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:09:47,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 43 [2018-04-13 06:09:47,848 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-13 06:09:47,858 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:09:47,861 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 95 treesize of output 79 [2018-04-13 06:09:47,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, 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 1 [2018-04-13 06:09:47,863 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-13 06:09:47,878 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:09:47,878 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:09:47,879 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:09:47,880 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:09:47,880 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:09:47,881 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:09:47,881 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:09:47,881 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:09:47,882 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:09:47,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 55 [2018-04-13 06:09:47,882 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-13 06:09:47,895 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:09:47,920 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 06:09:47,920 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 14 variables, input treesize:255, output treesize:21 [2018-04-13 06:09:47,971 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 06:09:47,972 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 06:09:47,972 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-13 06:09:47,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-13 06:09:47,972 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-13 06:09:47,972 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=263, Unknown=5, NotChecked=0, Total=342 [2018-04-13 06:09:47,973 INFO L87 Difference]: Start difference. First operand 255 states and 312 transitions. Second operand 19 states. [2018-04-13 06:09:48,880 WARN L151 SmtUtils]: Spent 131ms on a formula simplification. DAG size of input: 78 DAG size of output 77 [2018-04-13 06:09:49,427 WARN L151 SmtUtils]: Spent 133ms on a formula simplification. DAG size of input: 133 DAG size of output 90 [2018-04-13 06:09:49,560 WARN L148 SmtUtils]: Spent 111ms on a formula simplification that was a NOOP. DAG size: 135 [2018-04-13 06:09:51,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:09:51,036 INFO L93 Difference]: Finished difference Result 449 states and 538 transitions. [2018-04-13 06:09:51,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-13 06:09:51,036 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 48 [2018-04-13 06:09:51,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:09:51,037 INFO L225 Difference]: With dead ends: 449 [2018-04-13 06:09:51,037 INFO L226 Difference]: Without dead ends: 449 [2018-04-13 06:09:51,038 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=339, Invalid=1368, Unknown=15, NotChecked=0, Total=1722 [2018-04-13 06:09:51,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2018-04-13 06:09:51,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 313. [2018-04-13 06:09:51,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-04-13 06:09:51,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 383 transitions. [2018-04-13 06:09:51,042 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 383 transitions. Word has length 48 [2018-04-13 06:09:51,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:09:51,042 INFO L459 AbstractCegarLoop]: Abstraction has 313 states and 383 transitions. [2018-04-13 06:09:51,042 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-13 06:09:51,042 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 383 transitions. [2018-04-13 06:09:51,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-13 06:09:51,043 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:09:51,043 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:09:51,043 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:09:51,043 INFO L82 PathProgramCache]: Analyzing trace with hash -136940696, now seen corresponding path program 1 times [2018-04-13 06:09:51,043 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:09:51,043 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:09:51,044 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:09:51,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:09:51,044 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:09:51,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:09:51,050 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:09:51,092 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-13 06:09:51,092 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:09:51,092 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-13 06:09:51,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-13 06:09:51,093 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-13 06:09:51,093 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-04-13 06:09:51,093 INFO L87 Difference]: Start difference. First operand 313 states and 383 transitions. Second operand 7 states. [2018-04-13 06:09:51,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:09:51,239 INFO L93 Difference]: Finished difference Result 403 states and 486 transitions. [2018-04-13 06:09:51,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-13 06:09:51,239 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-04-13 06:09:51,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:09:51,240 INFO L225 Difference]: With dead ends: 403 [2018-04-13 06:09:51,240 INFO L226 Difference]: Without dead ends: 403 [2018-04-13 06:09:51,240 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:09:51,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2018-04-13 06:09:51,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 341. [2018-04-13 06:09:51,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-04-13 06:09:51,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 411 transitions. [2018-04-13 06:09:51,245 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 411 transitions. Word has length 50 [2018-04-13 06:09:51,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:09:51,245 INFO L459 AbstractCegarLoop]: Abstraction has 341 states and 411 transitions. [2018-04-13 06:09:51,245 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-13 06:09:51,245 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 411 transitions. [2018-04-13 06:09:51,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-13 06:09:51,246 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:09:51,246 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:09:51,246 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:09:51,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1249262698, now seen corresponding path program 1 times [2018-04-13 06:09:51,246 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:09:51,247 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:09:51,247 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:09:51,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:09:51,247 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:09:51,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:09:51,259 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:09:51,260 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:09:51,261 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:09:51,261 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:09:51,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:09:51,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:09:51,294 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:09:51,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:09:51,300 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:09:51,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:09:51,301 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-13 06:09:51,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:09:51,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:09:51,312 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:09:51,314 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:09:51,322 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:09:51,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:09:51,324 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:09:51,326 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:09:51,332 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:09:51,332 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2018-04-13 06:09:51,345 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:09:51,348 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:09:51,349 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:09:51,349 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:09:51,355 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:09:51,366 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:09:51,368 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:09:51,368 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:09:51,368 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:09:51,372 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:09:51,378 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:09:51,378 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:49, output treesize:41 [2018-04-13 06:09:51,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2018-04-13 06:09:51,410 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:09:51,421 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:09:51,421 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:54, output treesize:45 [2018-04-13 06:09:51,442 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:09:51,444 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:09:51,445 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:09:51,445 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:09:51,445 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:09:51,448 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:09:51,457 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:09:51,458 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:09:51,459 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:09:51,459 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:09:51,459 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:09:51,461 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:09:51,465 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:09:51,465 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:56, output treesize:7 [2018-04-13 06:09:51,478 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-13 06:09:51,478 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:09:51,478 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-13 06:09:51,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-13 06:09:51,478 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-13 06:09:51,478 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-04-13 06:09:51,478 INFO L87 Difference]: Start difference. First operand 341 states and 411 transitions. Second operand 10 states. [2018-04-13 06:09:51,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:09:51,854 INFO L93 Difference]: Finished difference Result 339 states and 405 transitions. [2018-04-13 06:09:51,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-13 06:09:51,855 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2018-04-13 06:09:51,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:09:51,856 INFO L225 Difference]: With dead ends: 339 [2018-04-13 06:09:51,856 INFO L226 Difference]: Without dead ends: 327 [2018-04-13 06:09:51,856 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2018-04-13 06:09:51,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-04-13 06:09:51,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 317. [2018-04-13 06:09:51,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-04-13 06:09:51,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 384 transitions. [2018-04-13 06:09:51,872 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 384 transitions. Word has length 50 [2018-04-13 06:09:51,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:09:51,873 INFO L459 AbstractCegarLoop]: Abstraction has 317 states and 384 transitions. [2018-04-13 06:09:51,873 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-13 06:09:51,873 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 384 transitions. [2018-04-13 06:09:51,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-13 06:09:51,873 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:09:51,873 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:09:51,873 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:09:51,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1290412237, now seen corresponding path program 1 times [2018-04-13 06:09:51,874 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:09:51,874 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:09:51,874 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:09:51,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:09:51,874 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:09:51,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:09:51,880 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:09:51,882 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:09:51,882 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:09:51,882 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:09:51,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:09:51,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:09:51,899 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:09:51,922 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:09:51,923 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:09:51,923 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:09:51,923 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:09:51,929 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:09:51,929 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-04-13 06:09:51,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:09:51,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, 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:09:51,941 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:09:51,942 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:09:51,950 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:09:51,950 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:35 [2018-04-13 06:09:51,975 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:09:51,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 44 [2018-04-13 06:09:51,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-13 06:09:51,981 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:09:51,985 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:09:51,992 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:09:51,992 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:46 [2018-04-13 06:09:52,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2018-04-13 06:09:52,029 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 20 treesize of output 25 [2018-04-13 06:09:52,029 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:09:52,035 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:09:52,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-13 06:09:52,043 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:64, output treesize:56 [2018-04-13 06:10:00,148 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 49 treesize of output 36 [2018-04-13 06:10:00,159 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 1 [2018-04-13 06:10:00,159 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:10:00,164 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:10:00,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-04-13 06:10:00,165 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:10:00,168 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:10:00,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:10:00,175 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:66, output treesize:15 [2018-04-13 06:10:00,231 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 06:10:00,231 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 06:10:00,231 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-13 06:10:00,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-13 06:10:00,231 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-13 06:10:00,232 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=181, Unknown=4, NotChecked=0, Total=240 [2018-04-13 06:10:00,232 INFO L87 Difference]: Start difference. First operand 317 states and 384 transitions. Second operand 16 states. [2018-04-13 06:10:35,599 WARN L151 SmtUtils]: Spent 4030ms on a formula simplification. DAG size of input: 63 DAG size of output 44 [2018-04-13 06:11:06,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:11:06,304 INFO L93 Difference]: Finished difference Result 709 states and 851 transitions. [2018-04-13 06:11:06,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-13 06:11:06,304 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 50 [2018-04-13 06:11:06,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:11:06,305 INFO L225 Difference]: With dead ends: 709 [2018-04-13 06:11:06,305 INFO L226 Difference]: Without dead ends: 709 [2018-04-13 06:11:06,306 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 62.6s TimeCoverageRelationStatistics Valid=310, Invalid=783, Unknown=29, NotChecked=0, Total=1122 [2018-04-13 06:11:06,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2018-04-13 06:11:06,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 410. [2018-04-13 06:11:06,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-04-13 06:11:06,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 509 transitions. [2018-04-13 06:11:06,309 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 509 transitions. Word has length 50 [2018-04-13 06:11:06,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:11:06,309 INFO L459 AbstractCegarLoop]: Abstraction has 410 states and 509 transitions. [2018-04-13 06:11:06,309 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-13 06:11:06,310 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 509 transitions. [2018-04-13 06:11:06,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-13 06:11:06,310 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:11:06,310 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:11:06,310 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:11:06,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1290412236, now seen corresponding path program 1 times [2018-04-13 06:11:06,310 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:11:06,310 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:11:06,311 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:11:06,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:11:06,311 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:11:06,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:11:06,316 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:11:06,319 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:11:06,319 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:11:06,319 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:11:06,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:11:06,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:11:06,335 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:11:06,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 06:11:06,338 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:11:06,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:11:06,348 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 06:11:06,365 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:11:06,365 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:11:06,366 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:11:06,366 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:11:06,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 06:11:06,375 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:11:06,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:11:06,382 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:37 [2018-04-13 06:11:06,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2018-04-13 06:11:06,395 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:11:06,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, 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:11:06,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 8 treesize of output 7 [2018-04-13 06:11:06,406 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:11:06,407 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:11:06,416 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:11:06,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 8 treesize of output 7 [2018-04-13 06:11:06,418 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 06:11:06,419 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:11:06,425 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:11:06,425 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:61, output treesize:39 [2018-04-13 06:11:06,449 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:11:06,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-04-13 06:11:06,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 12 treesize of output 11 [2018-04-13 06:11:06,454 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:11:06,457 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:11:06,467 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:11:06,470 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 47 [2018-04-13 06:11:06,472 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-13 06:11:06,472 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:11:06,476 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:11:06,484 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:11:06,484 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:77, output treesize:61 [2018-04-13 06:11:06,534 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:11:06,535 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:11:06,541 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 40 treesize of output 54 [2018-04-13 06:11:06,543 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 20 treesize of output 25 [2018-04-13 06:11:06,544 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:11:06,550 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:11:06,564 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:11:06,564 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:11:06,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 67 [2018-04-13 06:11:06,573 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 20 treesize of output 25 [2018-04-13 06:11:06,573 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:11:06,579 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:11:06,590 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:11:06,590 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:103, output treesize:87 [2018-04-13 06:11:10,697 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 51 treesize of output 42 [2018-04-13 06:11:10,698 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:11:10,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 30 treesize of output 22 [2018-04-13 06:11:10,699 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:11:10,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-13 06:11:10,704 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:11:10,707 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:11:10,717 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 24 treesize of output 22 [2018-04-13 06:11:10,718 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:11:10,718 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 06:11:10,721 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:11:10,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-13 06:11:10,722 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 06:11:10,723 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:11:10,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:11:10,729 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:86, output treesize:23 [2018-04-13 06:11:10,779 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 06:11:10,779 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 06:11:10,779 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-13 06:11:10,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-13 06:11:10,780 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-13 06:11:10,780 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=214, Unknown=2, NotChecked=0, Total=272 [2018-04-13 06:11:10,780 INFO L87 Difference]: Start difference. First operand 410 states and 509 transitions. Second operand 17 states. [2018-04-13 06:11:13,059 WARN L151 SmtUtils]: Spent 2033ms on a formula simplification. DAG size of input: 64 DAG size of output 57 [2018-04-13 06:11:14,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:11:14,224 INFO L93 Difference]: Finished difference Result 585 states and 693 transitions. [2018-04-13 06:11:14,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-13 06:11:14,224 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 50 [2018-04-13 06:11:14,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:11:14,225 INFO L225 Difference]: With dead ends: 585 [2018-04-13 06:11:14,225 INFO L226 Difference]: Without dead ends: 585 [2018-04-13 06:11:14,226 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=416, Invalid=1222, Unknown=2, NotChecked=0, Total=1640 [2018-04-13 06:11:14,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2018-04-13 06:11:14,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 421. [2018-04-13 06:11:14,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-04-13 06:11:14,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 529 transitions. [2018-04-13 06:11:14,230 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 529 transitions. Word has length 50 [2018-04-13 06:11:14,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:11:14,230 INFO L459 AbstractCegarLoop]: Abstraction has 421 states and 529 transitions. [2018-04-13 06:11:14,230 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-13 06:11:14,230 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 529 transitions. [2018-04-13 06:11:14,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-13 06:11:14,230 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:11:14,230 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:11:14,230 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:11:14,231 INFO L82 PathProgramCache]: Analyzing trace with hash 721092915, now seen corresponding path program 1 times [2018-04-13 06:11:14,231 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:11:14,231 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:11:14,231 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:11:14,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:11:14,231 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:11:14,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:11:14,237 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:11:14,239 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:11:14,239 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:11:14,240 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:11:14,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:11:14,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:11:14,256 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:11:14,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 6 treesize of output 5 [2018-04-13 06:11:14,258 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:11:14,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:11:14,260 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 06:11:14,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, 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 7 [2018-04-13 06:11:14,345 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:11:14,353 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:11:14,354 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:32 [2018-04-13 06:11:14,371 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:11:14,371 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:11:14,372 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:11:14,372 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:11:14,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:11:14,385 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:41 [2018-04-13 06:11:14,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2018-04-13 06:11:14,416 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:11:14,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 21 treesize of output 16 [2018-04-13 06:11:14,431 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:11:14,432 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:11:14,432 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:11:14,435 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:11:14,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 21 treesize of output 16 [2018-04-13 06:11:14,451 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:11:14,451 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 16 treesize of output 23 [2018-04-13 06:11:14,452 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 06:11:14,455 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:11:14,462 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:11:14,463 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:72, output treesize:37 [2018-04-13 06:11:14,515 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:11:14,521 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 61 [2018-04-13 06:11:14,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:11:14,524 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:11:14,531 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:11:14,549 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:11:14,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-13 06:11:14,551 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:11:14,556 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:11:14,568 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:11:14,569 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:83, output treesize:63 [2018-04-13 06:11:14,658 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 94 treesize of output 80 [2018-04-13 06:11:14,661 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 22 treesize of output 29 [2018-04-13 06:11:14,662 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:11:14,671 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:11:14,691 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 46 treesize of output 39 [2018-04-13 06:11:14,694 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 22 treesize of output 29 [2018-04-13 06:11:14,694 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:11:14,700 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:11:14,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-13 06:11:14,714 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:110, output treesize:90 [2018-04-13 06:11:20,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 62 [2018-04-13 06:11:20,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 1 [2018-04-13 06:11:20,805 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:11:20,814 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:11:20,815 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:11:20,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 33 [2018-04-13 06:11:20,817 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:11:20,831 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:11:20,842 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 31 treesize of output 27 [2018-04-13 06:11:20,844 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:11:20,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-13 06:11:20,844 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 06:11:20,850 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 1 [2018-04-13 06:11:20,850 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 06:11:20,851 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:11:20,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:11:20,857 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:107, output treesize:7 [2018-04-13 06:11:20,892 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:11:20,892 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 06:11:20,892 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-13 06:11:20,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-13 06:11:20,893 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-13 06:11:20,893 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=260, Unknown=3, NotChecked=0, Total=306 [2018-04-13 06:11:20,893 INFO L87 Difference]: Start difference. First operand 421 states and 529 transitions. Second operand 18 states. [2018-04-13 06:11:39,539 WARN L151 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 58 DAG size of output 51 [2018-04-13 06:11:53,315 WARN L151 SmtUtils]: Spent 4042ms on a formula simplification. DAG size of input: 93 DAG size of output 60 [2018-04-13 06:12:24,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:12:24,431 INFO L93 Difference]: Finished difference Result 606 states and 747 transitions. [2018-04-13 06:12:24,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-13 06:12:24,431 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 50 [2018-04-13 06:12:24,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:12:24,433 INFO L225 Difference]: With dead ends: 606 [2018-04-13 06:12:24,433 INFO L226 Difference]: Without dead ends: 606 [2018-04-13 06:12:24,433 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 55.3s TimeCoverageRelationStatistics Valid=400, Invalid=1467, Unknown=25, NotChecked=0, Total=1892 [2018-04-13 06:12:24,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2018-04-13 06:12:24,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 453. [2018-04-13 06:12:24,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 453 states. [2018-04-13 06:12:24,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 569 transitions. [2018-04-13 06:12:24,437 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 569 transitions. Word has length 50 [2018-04-13 06:12:24,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:12:24,437 INFO L459 AbstractCegarLoop]: Abstraction has 453 states and 569 transitions. [2018-04-13 06:12:24,438 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-13 06:12:24,438 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 569 transitions. [2018-04-13 06:12:24,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-13 06:12:24,438 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:12:24,438 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:12:24,439 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:12:24,439 INFO L82 PathProgramCache]: Analyzing trace with hash -660150828, now seen corresponding path program 1 times [2018-04-13 06:12:24,439 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:12:24,439 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:12:24,439 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:12:24,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:12:24,440 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:12:24,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:12:24,448 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:12:24,451 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:12:24,451 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:12:24,451 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:12:24,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:12:24,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:12:24,479 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:12:24,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:12:24,493 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:12:24,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, 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:12:24,498 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:12:24,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:12:24,508 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:11 [2018-04-13 06:12:24,536 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:12:24,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 06:12:24,537 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:12:24,549 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:12:24,550 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:12:24,551 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:12:24,551 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:12:24,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:12:24,559 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:25 [2018-04-13 06:12:24,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, 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:12:24,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, 2 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:12:24,575 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:12:24,576 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:12:24,585 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:12:24,585 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2018-04-13 06:12:24,610 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:12:24,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 44 [2018-04-13 06:12:24,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-13 06:12:24,615 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:12:24,620 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:12:24,627 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:12:24,627 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:48 [2018-04-13 06:12:24,662 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:12:24,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2018-04-13 06:12:24,671 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 20 treesize of output 25 [2018-04-13 06:12:24,671 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:12: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:12:24,686 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:12:24,686 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:61 [2018-04-13 06:12:30,712 WARN L151 SmtUtils]: Spent 2013ms on a formula simplification. DAG size of input: 31 DAG size of output 27 [2018-04-13 06:12:30,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 37 [2018-04-13 06:12:30,819 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:12:30,819 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:12:30,826 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 25 treesize of output 22 [2018-04-13 06:12:30,826 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-13 06:12:30,833 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-13 06:12:30,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-13 06:12:30,844 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:64, output treesize:73 [2018-04-13 06:12:30,985 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:12:30,985 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 06:12:30,985 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-13 06:12:30,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-13 06:12:30,986 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-13 06:12:30,986 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=228, Unknown=2, NotChecked=0, Total=272 [2018-04-13 06:12:30,986 INFO L87 Difference]: Start difference. First operand 453 states and 569 transitions. Second operand 17 states. [2018-04-13 06:12:33,282 WARN L151 SmtUtils]: Spent 2026ms on a formula simplification. DAG size of input: 51 DAG size of output 47 [2018-04-13 06:12:34,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:12:34,255 INFO L93 Difference]: Finished difference Result 617 states and 748 transitions. [2018-04-13 06:12:34,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-13 06:12:34,255 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 52 [2018-04-13 06:12:34,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:12:34,257 INFO L225 Difference]: With dead ends: 617 [2018-04-13 06:12:34,257 INFO L226 Difference]: Without dead ends: 616 [2018-04-13 06:12:34,257 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=282, Invalid=906, Unknown=2, NotChecked=0, Total=1190 [2018-04-13 06:12:34,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2018-04-13 06:12:34,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 448. [2018-04-13 06:12:34,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2018-04-13 06:12:34,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 561 transitions. [2018-04-13 06:12:34,262 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 561 transitions. Word has length 52 [2018-04-13 06:12:34,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:12:34,262 INFO L459 AbstractCegarLoop]: Abstraction has 448 states and 561 transitions. [2018-04-13 06:12:34,263 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-13 06:12:34,263 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 561 transitions. [2018-04-13 06:12:34,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-13 06:12:34,263 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:12:34,263 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:12:34,263 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:12:34,264 INFO L82 PathProgramCache]: Analyzing trace with hash -338982956, now seen corresponding path program 1 times [2018-04-13 06:12:34,264 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:12:34,264 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:12:34,264 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:12:34,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:12:34,264 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:12:34,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:12:34,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:12:34,276 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:12:34,276 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:12:34,276 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:12:34,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:12:34,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:12:34,305 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:12:34,345 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:12:34,346 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:12:34,346 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:12:34,347 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:12:34,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:12:34,362 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:30 [2018-04-13 06:12:34,382 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:12:34,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:12:34,384 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:12:34,386 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:12:34,404 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:12:34,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:12:34,406 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:12:34,408 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:12:34,418 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:12:34,418 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:58, output treesize:48 [2018-04-13 06:12:34,434 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2018-04-13 06:12:34,435 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:12:34,435 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:12:34,437 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:12:34,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:12:34,445 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:42 [2018-04-13 06:12:34,493 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:12:34,496 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:12:34,497 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 29 treesize of output 38 [2018-04-13 06:12:34,545 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:12:34,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 29 [2018-04-13 06:12:34,559 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:12:34,566 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:12:34,577 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:12:34,577 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:56, output treesize:52 [2018-04-13 06:12:34,630 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 4 case distinctions, treesize of input 54 treesize of output 63 [2018-04-13 06:12:34,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 54 [2018-04-13 06:12:34,632 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:12:34,646 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:12:34,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-13 06:12:34,654 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:71, output treesize:61 [2018-04-13 06:12:34,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 53 [2018-04-13 06:12:34,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 29 [2018-04-13 06:12:34,745 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:12:34,769 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:12:34,770 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 27 [2018-04-13 06:12:34,770 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:12:34,791 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 29 treesize of output 14 [2018-04-13 06:12:34,791 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:12:34,831 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:12:34,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 28 [2018-04-13 06:12:34,836 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-13 06:12:34,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 10 [2018-04-13 06:12:34,860 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 06:12:34,866 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:12:34,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:12:34,871 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:70, output treesize:15 [2018-04-13 06:12:34,920 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 06:12:34,920 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 06:12:34,920 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-13 06:12:34,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-13 06:12:34,920 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-13 06:12:34,920 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2018-04-13 06:12:34,920 INFO L87 Difference]: Start difference. First operand 448 states and 561 transitions. Second operand 16 states. [2018-04-13 06:12:36,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:12:36,359 INFO L93 Difference]: Finished difference Result 851 states and 1027 transitions. [2018-04-13 06:12:36,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-13 06:12:36,359 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 52 [2018-04-13 06:12:36,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:12:36,360 INFO L225 Difference]: With dead ends: 851 [2018-04-13 06:12:36,360 INFO L226 Difference]: Without dead ends: 851 [2018-04-13 06:12:36,361 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=373, Invalid=887, Unknown=0, NotChecked=0, Total=1260 [2018-04-13 06:12:36,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2018-04-13 06:12:36,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 492. [2018-04-13 06:12:36,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2018-04-13 06:12:36,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 615 transitions. [2018-04-13 06:12:36,365 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 615 transitions. Word has length 52 [2018-04-13 06:12:36,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:12:36,366 INFO L459 AbstractCegarLoop]: Abstraction has 492 states and 615 transitions. [2018-04-13 06:12:36,366 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-13 06:12:36,366 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 615 transitions. [2018-04-13 06:12:36,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-13 06:12:36,366 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:12:36,366 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:12:36,366 INFO L408 AbstractCegarLoop]: === Iteration 33 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:12:36,366 INFO L82 PathProgramCache]: Analyzing trace with hash -338982955, now seen corresponding path program 1 times [2018-04-13 06:12:36,366 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:12:36,366 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:12:36,367 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:12:36,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:12:36,367 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:12:36,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:12:36,372 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:12:36,376 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:12:36,376 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:12:36,376 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:12:36,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:12:36,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:12:36,400 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:12:36,414 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:12:36,415 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:12:36,415 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:12:36,416 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:12:36,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:12:36,429 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:12:36,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:12:36,436 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:32 [2018-04-13 06:12:36,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2018-04-13 06:12:36,445 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:12:36,454 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:12:36,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:12:36,455 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:12:36,456 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:12:36,464 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:12:36,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, 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:12:36,465 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 06:12:36,466 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:12:36,472 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:12:36,472 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:60, output treesize:40 [2018-04-13 06:12:36,494 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:12:36,498 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 42 treesize of output 46 [2018-04-13 06:12:36,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:12:36,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:12:36,505 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:12:36,515 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:12:36,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, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 55 [2018-04-13 06:12:36,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 14 treesize of output 13 [2018-04-13 06:12:36,521 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:12:36,525 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:12:36,534 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:12:36,534 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:95, output treesize:75 [2018-04-13 06:12:36,564 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 57 treesize of output 50 [2018-04-13 06:12:36,566 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 22 treesize of output 29 [2018-04-13 06:12:36,567 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:12:36,572 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:12:36,585 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 88 treesize of output 74 [2018-04-13 06:12:36,587 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 22 treesize of output 29 [2018-04-13 06:12:36,587 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:12:36,595 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:12:36,604 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:12:36,604 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:119, output treesize:99 [2018-04-13 06:12:42,632 WARN L148 SmtUtils]: Spent 2015ms on a formula simplification that was a NOOP. DAG size: 38 [2018-04-13 06:12:46,657 WARN L148 SmtUtils]: Spent 2008ms on a formula simplification that was a NOOP. DAG size: 38 [2018-04-13 06:12:46,665 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 87 treesize of output 61 [2018-04-13 06:12:46,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 26 [2018-04-13 06:12:46,667 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:12:46,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 1 [2018-04-13 06:12:46,676 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:12:46,679 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:12:46,687 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 44 treesize of output 38 [2018-04-13 06:12:46,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2018-04-13 06:12:46,689 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 06:12:46,695 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 1 [2018-04-13 06:12:46,695 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 06:12:46,696 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:12:46,700 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:12:46,700 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:117, output treesize:9 [2018-04-13 06:12:46,728 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 06:12:46,728 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 06:12:46,728 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-13 06:12:46,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-13 06:12:46,729 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-13 06:12:46,729 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=122, Unknown=3, NotChecked=0, Total=156 [2018-04-13 06:12:46,729 INFO L87 Difference]: Start difference. First operand 492 states and 615 transitions. Second operand 13 states. [2018-04-13 06:12:51,004 WARN L151 SmtUtils]: Spent 4065ms on a formula simplification. DAG size of input: 99 DAG size of output 67 [2018-04-13 06:12:55,080 WARN L151 SmtUtils]: Spent 4056ms on a formula simplification. DAG size of input: 97 DAG size of output 62 [2018-04-13 06:12:59,152 WARN L151 SmtUtils]: Spent 4058ms on a formula simplification. DAG size of input: 99 DAG size of output 64 [2018-04-13 06:13:03,252 WARN L151 SmtUtils]: Spent 4046ms on a formula simplification. DAG size of input: 84 DAG size of output 49 [2018-04-13 06:13:07,329 WARN L151 SmtUtils]: Spent 4049ms on a formula simplification. DAG size of input: 88 DAG size of output 53 [2018-04-13 06:13:11,474 WARN L151 SmtUtils]: Spent 4050ms on a formula simplification. DAG size of input: 93 DAG size of output 58 [2018-04-13 06:13:13,517 WARN L148 SmtUtils]: Spent 2016ms on a formula simplification that was a NOOP. DAG size: 43 [2018-04-13 06:13:13,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:13:13,971 INFO L93 Difference]: Finished difference Result 792 states and 951 transitions. [2018-04-13 06:13:13,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-13 06:13:13,971 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 52 [2018-04-13 06:13:13,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:13:13,973 INFO L225 Difference]: With dead ends: 792 [2018-04-13 06:13:13,973 INFO L226 Difference]: Without dead ends: 792 [2018-04-13 06:13:13,973 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 36.5s TimeCoverageRelationStatistics Valid=117, Invalid=342, Unknown=3, NotChecked=0, Total=462 [2018-04-13 06:13:13,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2018-04-13 06:13:13,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 490. [2018-04-13 06:13:13,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2018-04-13 06:13:13,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 612 transitions. [2018-04-13 06:13:13,979 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 612 transitions. Word has length 52 [2018-04-13 06:13:13,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:13:13,979 INFO L459 AbstractCegarLoop]: Abstraction has 490 states and 612 transitions. [2018-04-13 06:13:13,979 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-13 06:13:13,980 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 612 transitions. [2018-04-13 06:13:13,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-13 06:13:13,980 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:13:13,980 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:13:13,980 INFO L408 AbstractCegarLoop]: === Iteration 34 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:13:13,980 INFO L82 PathProgramCache]: Analyzing trace with hash -344708594, now seen corresponding path program 1 times [2018-04-13 06:13:13,980 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:13:13,980 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:13:13,981 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:13:13,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:13:13,981 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:13:13,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:13:13,985 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:13:14,050 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:13:14,051 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:13:14,051 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-13 06:13:14,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-13 06:13:14,051 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-13 06:13:14,051 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-13 06:13:14,051 INFO L87 Difference]: Start difference. First operand 490 states and 612 transitions. Second operand 6 states. [2018-04-13 06:13:14,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:13:14,178 INFO L93 Difference]: Finished difference Result 491 states and 609 transitions. [2018-04-13 06:13:14,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-13 06:13:14,179 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2018-04-13 06:13:14,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:13:14,180 INFO L225 Difference]: With dead ends: 491 [2018-04-13 06:13:14,180 INFO L226 Difference]: Without dead ends: 491 [2018-04-13 06:13:14,180 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:13:14,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2018-04-13 06:13:14,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 490. [2018-04-13 06:13:14,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2018-04-13 06:13:14,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 609 transitions. [2018-04-13 06:13:14,183 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 609 transitions. Word has length 52 [2018-04-13 06:13:14,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:13:14,183 INFO L459 AbstractCegarLoop]: Abstraction has 490 states and 609 transitions. [2018-04-13 06:13:14,183 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-13 06:13:14,183 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 609 transitions. [2018-04-13 06:13:14,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-13 06:13:14,183 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:13:14,184 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:13:14,184 INFO L408 AbstractCegarLoop]: === Iteration 35 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:13:14,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1911310923, now seen corresponding path program 1 times [2018-04-13 06:13:14,184 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:13:14,184 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:13:14,184 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:13:14,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:13:14,184 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:13:14,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:13:14,190 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:13:14,192 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:13:14,192 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:13:14,192 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:13:14,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:13:14,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:13:14,206 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:13:14,215 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:13:14,216 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:13:14,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-13 06:13:14,217 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:13:14,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:13:14,223 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:25 [2018-04-13 06:13:14,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2018-04-13 06:13:14,232 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:13:14,240 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:13:14,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 06:13:14,241 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:13:14,243 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:13:14,249 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:13:14,250 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:43, output treesize:27 [2018-04-13 06:13:14,284 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:13:14,289 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 41 [2018-04-13 06:13:14,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:13:14,291 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:13:14,295 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:13:14,301 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:13:14,301 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:40 [2018-04-13 06:13:14,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 45 [2018-04-13 06:13:14,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, 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 29 [2018-04-13 06:13:14,334 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:13:14,338 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:13:14,343 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:13:14,343 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:59, output treesize:49 [2018-04-13 06:13:20,421 WARN L151 SmtUtils]: Spent 2053ms on a formula simplification. DAG size of input: 23 DAG size of output 19 [2018-04-13 06:13:22,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 31 [2018-04-13 06:13:22,476 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:13:22,476 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:13:22,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2018-04-13 06:13:22,480 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:13:22,481 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:13:22,483 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:13:22,483 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:45, output treesize:4 [2018-04-13 06:13:22,515 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 06:13:22,516 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:13:22,516 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-04-13 06:13:22,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-13 06:13:22,516 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-13 06:13:22,516 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=122, Unknown=3, NotChecked=0, Total=156 [2018-04-13 06:13:22,516 INFO L87 Difference]: Start difference. First operand 490 states and 609 transitions. Second operand 13 states. [2018-04-13 06:13:50,741 WARN L151 SmtUtils]: Spent 2030ms on a formula simplification. DAG size of input: 60 DAG size of output 40 [2018-04-13 06:14:09,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:14:09,409 INFO L93 Difference]: Finished difference Result 762 states and 922 transitions. [2018-04-13 06:14:09,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-13 06:14:09,409 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2018-04-13 06:14:09,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:14:09,410 INFO L225 Difference]: With dead ends: 762 [2018-04-13 06:14:09,410 INFO L226 Difference]: Without dead ends: 762 [2018-04-13 06:14:09,411 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 42.5s TimeCoverageRelationStatistics Valid=168, Invalid=515, Unknown=19, NotChecked=0, Total=702 [2018-04-13 06:14:09,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2018-04-13 06:14:09,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 490. [2018-04-13 06:14:09,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2018-04-13 06:14:09,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 608 transitions. [2018-04-13 06:14:09,415 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 608 transitions. Word has length 54 [2018-04-13 06:14:09,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:14:09,415 INFO L459 AbstractCegarLoop]: Abstraction has 490 states and 608 transitions. [2018-04-13 06:14:09,415 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-13 06:14:09,415 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 608 transitions. [2018-04-13 06:14:09,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-13 06:14:09,415 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:14:09,415 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:14:09,415 INFO L408 AbstractCegarLoop]: === Iteration 36 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:14:09,415 INFO L82 PathProgramCache]: Analyzing trace with hash -640106729, now seen corresponding path program 1 times [2018-04-13 06:14:09,415 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:14:09,416 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:14:09,416 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:14:09,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:14:09,416 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:14:09,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:14:09,428 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:14:09,431 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:14:09,431 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:14:09,431 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:14:09,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:14:09,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:14:09,467 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:14:09,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 06:14:09,481 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:14:09,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:14:09,486 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-04-13 06:14:09,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-13 06:14:09,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, 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:14:09,497 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:14:09,498 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:14:09,507 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:14:09,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:14:09,509 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:14:09,510 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:14:09,518 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:14:09,518 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:30 [2018-04-13 06:14:09,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, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 64 [2018-04-13 06:14:09,582 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 61 [2018-04-13 06:14:09,583 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:14:09,607 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:14:09,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 61 [2018-04-13 06:14:09,640 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:14:09,641 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:14:09,641 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 41 treesize of output 77 [2018-04-13 06:14:09,642 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:14:09,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2018-04-13 06:14:09,664 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 06:14:09,674 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:14:09,688 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:14:09,688 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:88, output treesize:68 [2018-04-13 06:14:09,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, 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 65 [2018-04-13 06:14:09,743 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 50 treesize of output 57 [2018-04-13 06:14:09,744 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:14:09,783 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:14:09,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 73 [2018-04-13 06:14:09,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 71 treesize of output 78 [2018-04-13 06:14:09,825 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:14:09,858 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:14:09,867 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 60 [2018-04-13 06:14:09,867 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-13 06:14:09,895 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 06:14:09,937 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 2 xjuncts. [2018-04-13 06:14:09,937 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:112, output treesize:146 [2018-04-13 06:14:10,278 WARN L151 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 51 DAG size of output 47 [2018-04-13 06:14:10,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 41 [2018-04-13 06:14:10,331 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 37 treesize of output 32 [2018-04-13 06:14:10,331 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:14:10,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2018-04-13 06:14:10,345 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:14:10,353 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:14:10,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 29 [2018-04-13 06:14:10,366 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 16 [2018-04-13 06:14:10,367 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 06:14:10,377 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 11 [2018-04-13 06:14:10,377 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 06:14:10,386 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:14:10,387 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:14:10,387 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 21 treesize of output 14 [2018-04-13 06:14:10,387 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-13 06:14:10,392 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:14:10,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:14:10,396 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:71, output treesize:16 [2018-04-13 06:14:10,438 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 06:14:10,438 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 06:14:10,438 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-13 06:14:10,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-13 06:14:10,438 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-13 06:14:10,438 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2018-04-13 06:14:10,439 INFO L87 Difference]: Start difference. First operand 490 states and 608 transitions. Second operand 17 states. [2018-04-13 06:14:11,272 WARN L151 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 97 DAG size of output 64 [2018-04-13 06:14:12,170 WARN L151 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 92 DAG size of output 59 [2018-04-13 06:14:12,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:14:12,275 INFO L93 Difference]: Finished difference Result 799 states and 969 transitions. [2018-04-13 06:14:12,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-13 06:14:12,275 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56 [2018-04-13 06:14:12,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:14:12,276 INFO L225 Difference]: With dead ends: 799 [2018-04-13 06:14:12,277 INFO L226 Difference]: Without dead ends: 799 [2018-04-13 06:14:12,277 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=324, Invalid=1082, Unknown=0, NotChecked=0, Total=1406 [2018-04-13 06:14:12,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2018-04-13 06:14:12,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 528. [2018-04-13 06:14:12,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2018-04-13 06:14:12,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 654 transitions. [2018-04-13 06:14:12,281 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 654 transitions. Word has length 56 [2018-04-13 06:14:12,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:14:12,281 INFO L459 AbstractCegarLoop]: Abstraction has 528 states and 654 transitions. [2018-04-13 06:14:12,281 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-13 06:14:12,281 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 654 transitions. [2018-04-13 06:14:12,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-13 06:14:12,282 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:14:12,282 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:14:12,282 INFO L408 AbstractCegarLoop]: === Iteration 37 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:14:12,282 INFO L82 PathProgramCache]: Analyzing trace with hash -645832368, now seen corresponding path program 1 times [2018-04-13 06:14:12,282 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:14:12,282 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:14:12,283 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:14:12,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:14:12,283 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:14:12,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:14:12,294 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:14:12,297 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:14:12,298 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:14:12,298 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:14:12,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:14:12,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:14:12,360 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:14:12,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 6 treesize of output 5 [2018-04-13 06:14:12,368 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:14:12,371 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:14:12,372 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 06:14:12,396 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:14:12,397 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:14:12,397 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:14:12,397 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:14:12,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:14:12,408 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-04-13 06:14:12,426 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:14:12,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 06:14:12,428 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:14:12,430 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:14:12,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 11 treesize of output 8 [2018-04-13 06:14:12,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 8 treesize of output 7 [2018-04-13 06:14:12,449 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:14:12,451 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:14:12,464 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:14:12,464 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:54, output treesize:39 [2018-04-13 06:14:12,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2018-04-13 06:14:12,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-13 06:14:12,487 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:14:12,490 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:14:12,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:14:12,502 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:42 [2018-04-13 06:14:12,525 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:14:12,530 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 44 [2018-04-13 06:14:12,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-13 06:14:12,533 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:14:12,540 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:14:12,553 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:14:12,553 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:57, output treesize:49 [2018-04-13 06:14:12,608 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:14:12,609 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:14:12,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 51 [2018-04-13 06:14:12,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 20 treesize of output 25 [2018-04-13 06:14:12,623 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:14:12,631 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:14:12,655 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:14:12,655 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:70, output treesize:62 [2018-04-13 06:14:12,690 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:14:12,690 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:14:12,691 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:14:12,692 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 26 treesize of output 50 [2018-04-13 06:14:12,692 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:14:12,715 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:14:12,716 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:66 [2018-04-13 06:14:12,752 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:14:12,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 51 [2018-04-13 06:14:12,761 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:14:12,762 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 45 treesize of output 63 [2018-04-13 06:14:12,762 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:14:12,776 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:14:12,797 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:14:12,798 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:79, output treesize:84 [2018-04-13 06:14:12,891 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:14:12,892 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:14:12,904 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 105 [2018-04-13 06:14:12,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:14:12,907 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:14:12,923 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:14:12,945 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:14:12,946 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:107, output treesize:97 [2018-04-13 06:14:13,060 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 102 treesize of output 91 [2018-04-13 06:14:13,066 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 22 treesize of output 29 [2018-04-13 06:14:13,067 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:14:13,079 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:14:13,099 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-13 06:14:13,099 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:116, output treesize:106 [2018-04-13 06:14:19,152 WARN L151 SmtUtils]: Spent 2033ms on a formula simplification. DAG size of input: 43 DAG size of output 39 [2018-04-13 06:14:23,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 62 [2018-04-13 06:14:23,256 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:14:23,256 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:14:23,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 30 [2018-04-13 06:14:23,257 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:14:23,265 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:14:23,265 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:14:23,270 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:14:23,271 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:14:23,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:14:23,282 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:14:23,282 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:95, output treesize:28 [2018-04-13 06:14:23,360 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 06:14:23,360 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 06:14:23,360 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-13 06:14:23,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-13 06:14:23,361 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-13 06:14:23,361 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=304, Unknown=4, NotChecked=0, Total=380 [2018-04-13 06:14:23,361 INFO L87 Difference]: Start difference. First operand 528 states and 654 transitions. Second operand 20 states. [2018-04-13 06:16:40,795 WARN L151 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 107 DAG size of output 63 [2018-04-13 06:16:46,957 WARN L151 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 109 DAG size of output 68 [2018-04-13 06:16:47,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:16:47,069 INFO L93 Difference]: Finished difference Result 1543 states and 1881 transitions. [2018-04-13 06:16:47,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-04-13 06:16:47,069 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 56 [2018-04-13 06:16:47,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:16:47,072 INFO L225 Difference]: With dead ends: 1543 [2018-04-13 06:16:47,072 INFO L226 Difference]: Without dead ends: 1543 [2018-04-13 06:16:47,072 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 878 ImplicationChecksByTransitivity, 121.1s TimeCoverageRelationStatistics Valid=855, Invalid=2747, Unknown=58, NotChecked=0, Total=3660 [2018-04-13 06:16:47,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1543 states. [2018-04-13 06:16:47,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1543 to 1018. [2018-04-13 06:16:47,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1018 states. [2018-04-13 06:16:47,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 1284 transitions. [2018-04-13 06:16:47,081 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 1284 transitions. Word has length 56 [2018-04-13 06:16:47,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:16:47,082 INFO L459 AbstractCegarLoop]: Abstraction has 1018 states and 1284 transitions. [2018-04-13 06:16:47,082 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-13 06:16:47,082 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1284 transitions. [2018-04-13 06:16:47,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-13 06:16:47,082 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:16:47,082 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:16:47,083 INFO L408 AbstractCegarLoop]: === Iteration 38 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:16:47,083 INFO L82 PathProgramCache]: Analyzing trace with hash -645832367, now seen corresponding path program 1 times [2018-04-13 06:16:47,083 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:16:47,083 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:16:47,083 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:16:47,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:16:47,084 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:16:47,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:16:47,095 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:16:47,098 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:16:47,099 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:16:47,099 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:16:47,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:16:47,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:16:47,149 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:16:47,199 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:16:47,200 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:16:47,200 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:16:47,201 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:16:47,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, 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:16:47,215 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:16:47,227 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:16:47,227 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:35 [2018-04-13 06:16:47,251 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:16:47,253 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:16:47,253 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:16:47,256 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:16:47,272 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:16:47,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:16:47,274 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:16:47,275 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:16:47,287 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:16:47,287 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:59, output treesize:51 [2018-04-13 06:16:47,336 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:16:47,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 72 [2018-04-13 06:16:47,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 12 treesize of output 11 [2018-04-13 06:16:47,344 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:16:47,352 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:16:47,367 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:16:47,370 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 27 treesize of output 28 [2018-04-13 06:16:47,371 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:16:47,371 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:16:47,374 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:16:47,385 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:16:47,385 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:89, output treesize:73 [2018-04-13 06:16:47,433 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:16:47,434 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:16:47,438 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 40 treesize of output 46 [2018-04-13 06:16:47,440 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 20 treesize of output 25 [2018-04-13 06:16:47,441 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:16:47,447 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:16:47,467 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:16:47,467 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:16:47,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 84 [2018-04-13 06:16:47,476 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 20 treesize of output 25 [2018-04-13 06:16:47,476 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:16:47,485 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:16:47,499 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:16:47,500 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:115, output treesize:99 [2018-04-13 06:16:51,548 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:16:51,549 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:16:51,549 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:16:51,550 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 20 treesize of output 21 [2018-04-13 06:16:51,550 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:16:51,564 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 16 treesize of output 23 [2018-04-13 06:16:51,564 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:16:51,575 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:16:51,576 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:91, output treesize:83 [2018-04-13 06:16:51,600 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:16:51,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 40 [2018-04-13 06:16:51,606 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:16:51,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 16 treesize of output 23 [2018-04-13 06:16:51,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:16:51,620 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:16:51,641 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:16:51,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 64 [2018-04-13 06:16:51,648 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:16:51,649 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 58 treesize of output 78 [2018-04-13 06:16:51,649 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:16:51,659 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:16:51,676 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:16:51,676 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:106, output treesize:107 [2018-04-13 06:16:51,761 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:16:51,762 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:16:51,776 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 88 [2018-04-13 06:16:51,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:16:51,778 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:16:51,786 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:16:51,817 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:16:51,817 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:16:51,824 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 133 [2018-04-13 06:16:51,825 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-13 06:16:51,825 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:16:51,836 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:16:51,856 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:16:51,856 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:165, output treesize:145 [2018-04-13 06:16:51,958 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 155 treesize of output 144 [2018-04-13 06:16:51,961 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:16:51,961 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:16:51,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:16:51,975 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:16:52,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 101 [2018-04-13 06:16:52,010 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:16:52,010 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:16:52,010 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:16:52,024 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:16:52,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-13 06:16:52,045 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:198, output treesize:178 [2018-04-13 06:16:52,379 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:16:52,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 122 [2018-04-13 06:16:52,382 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:16:52,391 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 85 [2018-04-13 06:16:52,392 INFO L267 ElimStorePlain]: Start of recursive call 3: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-04-13 06:16:52,439 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:16:52,439 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:16:52,482 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:16:52,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 86 [2018-04-13 06:16:52,492 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-13 06:16:52,494 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:16:52,495 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 64 treesize of output 58 [2018-04-13 06:16:52,495 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 06:16:52,497 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:16:52,499 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:16:52,503 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 1 case distinctions, treesize of input 74 treesize of output 80 [2018-04-13 06:16:52,503 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-13 06:16:52,569 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-04-13 06:16:52,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 77 [2018-04-13 06:16:52,632 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:16:52,632 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:16:52,633 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 32 treesize of output 19 [2018-04-13 06:16:52,633 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-13 06:16:52,647 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:16:52,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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:16:52,647 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-13 06:16:52,657 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:16:52,657 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-13 06:16:52,664 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:16:52,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 81 [2018-04-13 06:16:52,670 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:16:52,670 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:16:52,670 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-13 06:16:52,686 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:16:52,686 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:16:52,686 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 32 treesize of output 19 [2018-04-13 06:16:52,687 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-13 06:16:52,699 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:16:52,699 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-13 06:16:52,707 INFO L267 ElimStorePlain]: Start of recursive call 12: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:16:52,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 77 [2018-04-13 06:16:52,712 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:16:52,712 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-13 06:16:52,727 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:16: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 13 treesize of output 6 [2018-04-13 06:16:52,727 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-13 06:16:52,740 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:16:52,741 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:16:52,741 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 32 treesize of output 19 [2018-04-13 06:16:52,741 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-13 06:16:52,759 INFO L267 ElimStorePlain]: Start of recursive call 16: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:16:52,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 77 [2018-04-13 06:16:52,765 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:16:52,765 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-13 06:16:52,781 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:16:52,781 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:16:52,782 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 32 treesize of output 19 [2018-04-13 06:16:52,782 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-13 06:16:52,794 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:16:52,794 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:16:52,795 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-13 06:16:52,813 INFO L267 ElimStorePlain]: Start of recursive call 20: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:16:52,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-04-13 06:16:52,854 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 8 variables, input treesize:206, output treesize:105 [2018-04-13 06:16:52,984 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 06:16:52,984 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 06:16:52,984 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-13 06:16:52,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-13 06:16:52,984 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-13 06:16:52,984 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=494, Unknown=2, NotChecked=0, Total=600 [2018-04-13 06:16:52,984 INFO L87 Difference]: Start difference. First operand 1018 states and 1284 transitions. Second operand 25 states. [2018-04-13 06:16:55,398 WARN L151 SmtUtils]: Spent 2035ms on a formula simplification. DAG size of input: 65 DAG size of output 56 [2018-04-13 06:16:56,331 WARN L151 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 118 DAG size of output 87 [2018-04-13 06:16:57,133 WARN L151 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 175 DAG size of output 103 [2018-04-13 06:16:57,304 WARN L151 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 175 DAG size of output 99 [2018-04-13 06:16:57,804 WARN L151 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 179 DAG size of output 100 [2018-04-13 06:16:59,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:16:59,538 INFO L93 Difference]: Finished difference Result 1505 states and 1865 transitions. [2018-04-13 06:16:59,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-04-13 06:16:59,539 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 56 [2018-04-13 06:16:59,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:16:59,541 INFO L225 Difference]: With dead ends: 1505 [2018-04-13 06:16:59,541 INFO L226 Difference]: Without dead ends: 1505 [2018-04-13 06:16:59,542 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 718 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=854, Invalid=2804, Unknown=2, NotChecked=0, Total=3660 [2018-04-13 06:16:59,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2018-04-13 06:16:59,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1219. [2018-04-13 06:16:59,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1219 states. [2018-04-13 06:16:59,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 1219 states and 1542 transitions. [2018-04-13 06:16:59,550 INFO L78 Accepts]: Start accepts. Automaton has 1219 states and 1542 transitions. Word has length 56 [2018-04-13 06:16:59,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:16:59,550 INFO L459 AbstractCegarLoop]: Abstraction has 1219 states and 1542 transitions. [2018-04-13 06:16:59,550 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-13 06:16:59,550 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 1542 transitions. [2018-04-13 06:16:59,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-13 06:16:59,551 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:16:59,551 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:16:59,551 INFO L408 AbstractCegarLoop]: === Iteration 39 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:16:59,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1997127379, now seen corresponding path program 1 times [2018-04-13 06:16:59,551 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:16:59,551 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:16:59,552 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:16:59,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:16:59,552 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:16:59,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:16:59,556 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:16:59,581 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 06:16:59,581 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:16:59,581 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:16:59,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:16:59,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:16:59,591 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:16:59,595 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:16:59,595 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:16:59,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:16:59,597 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2018-04-13 06:16:59,599 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 06:16:59,600 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 06:16:59,600 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2018-04-13 06:16:59,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-13 06:16:59,600 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-13 06:16:59,600 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-04-13 06:16:59,600 INFO L87 Difference]: Start difference. First operand 1219 states and 1542 transitions. Second operand 7 states. [2018-04-13 06:16:59,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:16:59,725 INFO L93 Difference]: Finished difference Result 1262 states and 1588 transitions. [2018-04-13 06:16:59,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-13 06:16:59,725 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2018-04-13 06:16:59,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:16:59,727 INFO L225 Difference]: With dead ends: 1262 [2018-04-13 06:16:59,727 INFO L226 Difference]: Without dead ends: 1262 [2018-04-13 06:16:59,727 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-04-13 06:16:59,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262 states. [2018-04-13 06:16:59,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262 to 1216. [2018-04-13 06:16:59,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1216 states. [2018-04-13 06:16:59,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1216 states and 1536 transitions. [2018-04-13 06:16:59,734 INFO L78 Accepts]: Start accepts. Automaton has 1216 states and 1536 transitions. Word has length 57 [2018-04-13 06:16:59,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:16:59,735 INFO L459 AbstractCegarLoop]: Abstraction has 1216 states and 1536 transitions. [2018-04-13 06:16:59,735 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-13 06:16:59,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 1536 transitions. [2018-04-13 06:16:59,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-13 06:16:59,735 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:16:59,735 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:16:59,735 INFO L408 AbstractCegarLoop]: === Iteration 40 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:16:59,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1997127378, now seen corresponding path program 1 times [2018-04-13 06:16:59,735 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:16:59,735 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:16:59,736 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:16:59,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:16:59,736 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:16:59,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:16:59,740 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:16:59,805 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-13 06:16:59,806 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:16:59,806 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:16:59,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:16:59,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:16:59,827 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:16:59,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:16:59,841 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:16:59,856 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:16:59,856 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 06:16:59,900 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:16:59,900 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:16:59,901 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:16:59,901 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:16:59,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 06:16:59,909 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:16:59,916 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:16:59,917 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:31 [2018-04-13 06:16:59,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 06:16:59,944 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:16:59,946 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:16:59,947 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2018-04-13 06:17:00,057 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 06:17:00,057 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 06:17:00,057 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 16 [2018-04-13 06:17:00,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-13 06:17:00,058 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-13 06:17:00,058 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2018-04-13 06:17:00,058 INFO L87 Difference]: Start difference. First operand 1216 states and 1536 transitions. Second operand 17 states. [2018-04-13 06:17:00,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:17:00,790 INFO L93 Difference]: Finished difference Result 1458 states and 1817 transitions. [2018-04-13 06:17:00,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-13 06:17:00,790 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 57 [2018-04-13 06:17:00,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:17:00,793 INFO L225 Difference]: With dead ends: 1458 [2018-04-13 06:17:00,793 INFO L226 Difference]: Without dead ends: 1458 [2018-04-13 06:17:00,793 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=263, Invalid=729, Unknown=0, NotChecked=0, Total=992 [2018-04-13 06:17:00,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2018-04-13 06:17:00,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 1237. [2018-04-13 06:17:00,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1237 states. [2018-04-13 06:17:00,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 1561 transitions. [2018-04-13 06:17:00,801 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 1561 transitions. Word has length 57 [2018-04-13 06:17:00,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:17:00,802 INFO L459 AbstractCegarLoop]: Abstraction has 1237 states and 1561 transitions. [2018-04-13 06:17:00,802 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-13 06:17:00,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 1561 transitions. [2018-04-13 06:17:00,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-13 06:17:00,802 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:17:00,802 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:17:00,802 INFO L408 AbstractCegarLoop]: === Iteration 41 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:17:00,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1000935743, now seen corresponding path program 1 times [2018-04-13 06:17:00,802 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:17:00,802 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:17:00,803 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:17:00,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:17:00,803 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:17:00,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:17:00,810 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:17:00,813 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:17:00,813 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:17:00,813 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:17:00,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:17:00,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:17:00,855 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:17:00,890 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:00,891 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:00,892 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:17:00,892 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:17:00,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:17:00,900 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-04-13 06:17:00,916 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:17:00,918 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:17:00,918 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:17:00,919 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:17:00,929 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:17:00,930 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2018-04-13 06:17:00,963 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:00,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 44 [2018-04-13 06:17:00,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:17:00,971 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:17:00,977 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:17:00,986 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:17:00,987 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:43 [2018-04-13 06:17:01,026 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:01,027 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:01,027 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:17:01,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 51 [2018-04-13 06:17:01,034 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 20 treesize of output 25 [2018-04-13 06:17:01,034 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:17:01,040 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:17:01,047 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:17:01,047 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:64, output treesize:56 [2018-04-13 06:17:07,081 WARN L151 SmtUtils]: Spent 2014ms on a formula simplification. DAG size of input: 32 DAG size of output 28 [2018-04-13 06:17:07,084 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:07,085 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:07,085 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:07,086 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 26 treesize of output 50 [2018-04-13 06:17:07,086 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:17:07,097 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:17:07,097 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:59, output treesize:65 [2018-04-13 06:17:07,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-13 06:17:07,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 06:17:07,131 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:17:07,133 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:17:07,147 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:07,150 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 53 [2018-04-13 06:17:07,152 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:07,153 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 47 treesize of output 65 [2018-04-13 06:17:07,153 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:17:07,160 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:17:07,171 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:17:07,172 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:88, output treesize:89 [2018-04-13 06:17:07,247 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 77 treesize of output 101 [2018-04-13 06:17:07,251 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:17:07,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 73 [2018-04-13 06:17:07,394 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:17:07,466 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:07,466 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:17:07,468 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 0 case distinctions, treesize of input 63 treesize of output 75 [2018-04-13 06:17:07,468 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:17:07,499 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-13 06:17:07,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 30 treesize of output 43 [2018-04-13 06:17:07,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:17:07,561 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 06:17:07,577 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:17:07,617 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2018-04-13 06:17:07,617 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:123, output treesize:336 [2018-04-13 06:17:07,763 WARN L151 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 104 DAG size of output 75 [2018-04-13 06:17:07,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 144 treesize of output 177 [2018-04-13 06:17:07,882 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-13 06:17:07,892 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:17:07,893 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:07,900 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 2 case distinctions, treesize of input 137 treesize of output 168 [2018-04-13 06:17:07,901 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:17:09,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 140 [2018-04-13 06:17:09,337 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:17:09,536 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:17:09,719 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:09,727 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 134 treesize of output 158 [2018-04-13 06:17:09,728 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-13 06:17:09,927 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:17:10,467 INFO L267 ElimStorePlain]: Start of recursive call 2: 10 dim-1 vars, End of recursive call: 4 dim-0 vars, and 6 xjuncts. [2018-04-13 06:17:10,769 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 6 case distinctions, treesize of input 128 treesize of output 149 [2018-04-13 06:17:10,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 132 [2018-04-13 06:17:10,773 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-13 06:17:10,973 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:10,974 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:10,981 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 120 treesize of output 138 [2018-04-13 06:17:10,982 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-13 06:17:11,159 INFO L267 ElimStorePlain]: Start of recursive call 8: 4 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-04-13 06:17:11,533 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 124 treesize of output 130 [2018-04-13 06:17:11,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 124 [2018-04-13 06:17:11,536 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-13 06:17:11,592 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:17:11,594 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:17:11,595 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 107 treesize of output 105 [2018-04-13 06:17:11,597 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:11,597 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:17:11,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-04-13 06:17:11,598 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-13 06:17:11,615 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:17:11,619 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 130 treesize of output 119 [2018-04-13 06:17:11,621 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:11,622 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:11,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 44 [2018-04-13 06:17:11,624 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-13 06:17:11,648 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:17:11,973 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 152 treesize of output 144 [2018-04-13 06:17:11,976 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:11,977 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:11,978 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 37 treesize of output 44 [2018-04-13 06:17:11,978 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-13 06:17:12,007 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:17:12,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 144 [2018-04-13 06:17:12,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 25 [2018-04-13 06:17:12,015 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-13 06:17:12,037 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:17:12,039 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:17:12,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 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:17:12,042 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:17:12,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 32 treesize of output 23 [2018-04-13 06:17:12,043 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-13 06:17:12,062 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:17:12,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 140 treesize of output 163 [2018-04-13 06:17:12,087 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:12,088 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:12,088 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:12,089 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 135 treesize of output 162 [2018-04-13 06:17:12,089 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-13 06:17:12,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 137 treesize of output 136 [2018-04-13 06:17:12,362 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-13 06:17:12,399 INFO L267 ElimStorePlain]: Start of recursive call 23: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:17:12,401 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:17:12,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, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 127 [2018-04-13 06:17:12,404 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:12,404 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:12,405 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:17:12,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2018-04-13 06:17:12,405 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-04-13 06:17:12,428 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:17:12,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 146 treesize of output 152 [2018-04-13 06:17:12,446 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:12,447 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:12,447 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:12,448 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 138 treesize of output 165 [2018-04-13 06:17:12,448 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-04-13 06:17:12,525 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 130 [2018-04-13 06:17:12,526 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-04-13 06:17:12,559 INFO L267 ElimStorePlain]: Start of recursive call 28: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:17:12,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 4 dim-2 vars, End of recursive call: 38 dim-0 vars, and 9 xjuncts. [2018-04-13 06:17:12,852 INFO L202 ElimStorePlain]: Needed 30 recursive calls to eliminate 14 variables, input treesize:273, output treesize:1029 [2018-04-13 06:17:15,577 WARN L151 SmtUtils]: Spent 2461ms on a formula simplification. DAG size of input: 330 DAG size of output 152 [2018-04-13 06:17:15,953 WARN L148 SmtUtils]: Spent 177ms on a formula simplification that was a NOOP. DAG size: 151 [2018-04-13 06:17:16,200 WARN L148 SmtUtils]: Spent 175ms on a formula simplification that was a NOOP. DAG size: 158 [2018-04-13 06:17:16,926 WARN L151 SmtUtils]: Spent 603ms on a formula simplification. DAG size of input: 400 DAG size of output 211 [2018-04-13 06:17:17,264 WARN L148 SmtUtils]: Spent 253ms on a formula simplification that was a NOOP. DAG size: 155 [2018-04-13 06:17:17,277 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 105 treesize of output 101 [2018-04-13 06:17:17,279 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:17:17,280 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:17:17,294 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:17:17,384 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:17,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 135 treesize of output 145 [2018-04-13 06:17:17,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 130 [2018-04-13 06:17:17,394 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:17:17,508 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 126 treesize of output 121 [2018-04-13 06:17:17,508 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 06:17:17,607 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:17,607 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:17,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 114 [2018-04-13 06:17:17,608 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 06:17:17,720 INFO L267 ElimStorePlain]: Start of recursive call 4: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:17:17,799 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:17,800 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:17,800 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 101 treesize of output 103 [2018-04-13 06:17:17,807 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 31 [2018-04-13 06:17:17,808 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-13 06:17:17,825 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:17:17,825 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-13 06:17:17,838 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:17:17,918 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:17,920 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:17,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 135 treesize of output 147 [2018-04-13 06:17:17,929 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 139 treesize of output 132 [2018-04-13 06:17:17,929 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-13 06:17:18,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 124 [2018-04-13 06:17:18,019 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-13 06:17:18,107 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 131 treesize of output 123 [2018-04-13 06:17:18,107 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-13 06:17:18,179 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 109 treesize of output 104 [2018-04-13 06:17:18,179 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-13 06:17:18,230 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:18,231 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 112 treesize of output 106 [2018-04-13 06:17:18,231 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-13 06:17:18,287 INFO L267 ElimStorePlain]: Start of recursive call 11: 7 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:17:18,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 18 dim-0 vars, 4 dim-2 vars, End of recursive call: 18 dim-0 vars, and 4 xjuncts. [2018-04-13 06:17:18,352 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 22 variables, input treesize:481, output treesize:375 [2018-04-13 06:17:18,795 WARN L151 SmtUtils]: Spent 271ms on a formula simplification. DAG size of input: 130 DAG size of output 79 [2018-04-13 06:17:18,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 107 treesize of output 120 [2018-04-13 06:17:18,825 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:18,825 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 91 treesize of output 78 [2018-04-13 06:17:18,826 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:17:19,328 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:19,329 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:17:19,329 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 72 treesize of output 62 [2018-04-13 06:17:19,330 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:17:19,773 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 97 treesize of output 92 [2018-04-13 06:17:19,773 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:17:20,207 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:20,208 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:17:20,208 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 92 treesize of output 80 [2018-04-13 06:17:20,208 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:17:20,642 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:20,644 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:20,644 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:20,645 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:20,645 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:20,646 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:20,646 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:20,647 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:17:20,647 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:17:20,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 8 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 101 [2018-04-13 06:17:20,648 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:17:21,094 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:21,095 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:17:21,095 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 97 treesize of output 85 [2018-04-13 06:17:21,096 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:17:21,521 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:21,522 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:21,523 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:21,523 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:17:21,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 100 [2018-04-13 06:17:21,528 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-13 06:17:21,990 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 73 treesize of output 59 [2018-04-13 06:17:21,991 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-13 06:17:22,430 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:22,430 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 99 treesize of output 93 [2018-04-13 06:17:22,431 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-13 06:17:22,878 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:22,881 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:22,881 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:22,882 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:22,882 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:22,883 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:22,883 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:22,883 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:17:22,883 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:17:22,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 97 [2018-04-13 06:17:22,884 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:17:23,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 88 [2018-04-13 06:17:23,324 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-13 06:17:23,750 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:23,751 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:23,751 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:23,752 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:23,752 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:23,753 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:23,753 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:17:23,753 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:17:23,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 99 [2018-04-13 06:17:23,754 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:17:24,219 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:24,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 74 [2018-04-13 06:17:24,219 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-13 06:17:24,625 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:24,625 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:17:24,626 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 68 treesize of output 58 [2018-04-13 06:17:24,626 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:17:25,032 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:25,032 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:17:25,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 73 [2018-04-13 06:17:25,033 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:17:25,444 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 77 treesize of output 72 [2018-04-13 06:17:25,444 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-13 06:17:25,445 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 71 treesize of output 66 [2018-04-13 06:17:25,446 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-13 06:17:25,839 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:25,841 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:25,841 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:25,842 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:25,842 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:25,843 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:25,843 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:17:25,843 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:17:25,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 8 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 97 [2018-04-13 06:17:25,844 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:17:26,250 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:26,251 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:26,251 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:26,251 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:17:26,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 93 treesize of output 109 [2018-04-13 06:17:26,271 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-13 06:17:26,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 65 [2018-04-13 06:17:26,735 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-13 06:17:26,736 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 66 treesize of output 59 [2018-04-13 06:17:26,736 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-13 06:17:27,155 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:27,156 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 93 treesize of output 80 [2018-04-13 06:17:27,171 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-13 06:17:27,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 61 [2018-04-13 06:17:27,590 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-13 06:17:27,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 70 [2018-04-13 06:17:27,591 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-04-13 06:17:27,592 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 78 treesize of output 73 [2018-04-13 06:17:27,593 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-04-13 06:17:27,998 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:27,998 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:17:27,998 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 103 treesize of output 89 [2018-04-13 06:17:27,999 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:17:28,416 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:28,418 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:28,418 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:28,419 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:28,419 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:28,420 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:28,420 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:17:28,420 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:17:28,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 97 [2018-04-13 06:17:28,421 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:17:28,858 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 82 treesize of output 75 [2018-04-13 06:17:28,858 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-04-13 06:17:29,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, 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 70 [2018-04-13 06:17:29,253 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-04-13 06:17:29,638 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 70 treesize of output 63 [2018-04-13 06:17:29,638 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-04-13 06:17:30,031 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 78 treesize of output 66 [2018-04-13 06:17:30,032 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-04-13 06:17:30,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 59 [2018-04-13 06:17:30,414 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-04-13 06:17:30,798 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:30,798 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:17:30,799 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 93 treesize of output 81 [2018-04-13 06:17:30,799 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:17:31,173 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 66 treesize of output 59 [2018-04-13 06:17:31,173 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-04-13 06:17:31,541 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:31,542 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:31,542 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:31,542 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:17:31,547 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 96 [2018-04-13 06:17:31,547 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-13 06:17:31,959 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:31,960 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:17:31,960 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 74 treesize of output 62 [2018-04-13 06:17:31,961 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:17:32,347 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 67 treesize of output 55 [2018-04-13 06:17:32,347 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-04-13 06:17:32,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, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 61 [2018-04-13 06:17:32,349 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-04-13 06:17:32,703 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:32,704 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 74 treesize of output 61 [2018-04-13 06:17:32,704 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-04-13 06:17:33,035 INFO L267 ElimStorePlain]: Start of recursive call 2: 34 dim-1 vars, End of recursive call: 17 dim-0 vars, and 19 xjuncts. [2018-04-13 06:17:33,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 85 [2018-04-13 06:17:33,444 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:33,444 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:17:33,446 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 72 treesize of output 63 [2018-04-13 06:17:33,446 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-04-13 06:17:33,488 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 78 treesize of output 73 [2018-04-13 06:17:33,489 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-04-13 06:17:33,524 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 73 treesize of output 66 [2018-04-13 06:17:33,524 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-04-13 06:17:33,557 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:17:33,557 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:17:33,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 55 [2018-04-13 06:17:33,559 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-04-13 06:17:33,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 41 [2018-04-13 06:17:33,596 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-04-13 06:17:33,615 INFO L267 ElimStorePlain]: Start of recursive call 42: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:17:33,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 13 dim-0 vars, 2 dim-2 vars, End of recursive call: 38 dim-0 vars, and 19 xjuncts. [2018-04-13 06:17:33,995 INFO L202 ElimStorePlain]: Needed 47 recursive calls to eliminate 15 variables, input treesize:198, output treesize:560 [2018-04-13 06:17:34,199 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 06:17:34,200 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 06:17:34,200 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-13 06:17:34,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-13 06:17:34,200 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-13 06:17:34,200 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=483, Unknown=6, NotChecked=0, Total=600 [2018-04-13 06:17:34,200 INFO L87 Difference]: Start difference. First operand 1237 states and 1561 transitions. Second operand 25 states. [2018-04-13 06:17:50,764 WARN L151 SmtUtils]: Spent 2023ms on a formula simplification. DAG size of input: 45 DAG size of output 39 [2018-04-13 06:17:59,412 WARN L151 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 83 DAG size of output 83 [2018-04-13 06:17:59,880 WARN L151 SmtUtils]: Spent 139ms on a formula simplification. DAG size of input: 110 DAG size of output 85 [2018-04-13 06:18:00,327 WARN L151 SmtUtils]: Spent 364ms on a formula simplification. DAG size of input: 237 DAG size of output 164 [2018-04-13 06:18:00,671 WARN L148 SmtUtils]: Spent 130ms on a formula simplification that was a NOOP. DAG size: 155 [2018-04-13 06:18:01,204 WARN L151 SmtUtils]: Spent 298ms on a formula simplification. DAG size of input: 232 DAG size of output 159 [2018-04-13 06:18:09,776 WARN L151 SmtUtils]: Spent 378ms on a formula simplification. DAG size of input: 239 DAG size of output 165 [2018-04-13 06:18:18,582 WARN L151 SmtUtils]: Spent 628ms on a formula simplification. DAG size of input: 361 DAG size of output 182 [2018-04-13 06:18:29,942 WARN L151 SmtUtils]: Spent 1178ms on a formula simplification. DAG size of input: 375 DAG size of output 111 [2018-04-13 06:18:34,050 WARN L151 SmtUtils]: Spent 2035ms on a formula simplification. DAG size of input: 59 DAG size of output 53 [2018-04-13 06:18:34,526 WARN L151 SmtUtils]: Spent 394ms on a formula simplification. DAG size of input: 280 DAG size of output 164 [2018-04-13 06:18:35,426 WARN L151 SmtUtils]: Spent 627ms on a formula simplification. DAG size of input: 297 DAG size of output 167 [2018-04-13 06:18:35,904 WARN L151 SmtUtils]: Spent 360ms on a formula simplification. DAG size of input: 172 DAG size of output 163 [2018-04-13 06:18:36,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:18:36,980 INFO L93 Difference]: Finished difference Result 1969 states and 2432 transitions. [2018-04-13 06:18:36,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-13 06:18:36,980 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 58 [2018-04-13 06:18:36,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:18:36,983 INFO L225 Difference]: With dead ends: 1969 [2018-04-13 06:18:36,983 INFO L226 Difference]: Without dead ends: 1969 [2018-04-13 06:18:36,984 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 835 ImplicationChecksByTransitivity, 59.8s TimeCoverageRelationStatistics Valid=711, Invalid=2804, Unknown=25, NotChecked=0, Total=3540 [2018-04-13 06:18:36,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2018-04-13 06:18:36,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1452. [2018-04-13 06:18:36,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1452 states. [2018-04-13 06:18:36,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1452 states to 1452 states and 1835 transitions. [2018-04-13 06:18:36,993 INFO L78 Accepts]: Start accepts. Automaton has 1452 states and 1835 transitions. Word has length 58 [2018-04-13 06:18:36,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:18:36,994 INFO L459 AbstractCegarLoop]: Abstraction has 1452 states and 1835 transitions. [2018-04-13 06:18:36,994 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-13 06:18:36,994 INFO L276 IsEmpty]: Start isEmpty. Operand 1452 states and 1835 transitions. [2018-04-13 06:18:36,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-13 06:18:36,994 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:18:36,994 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:18:36,994 INFO L408 AbstractCegarLoop]: === Iteration 42 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:18:36,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1000935744, now seen corresponding path program 1 times [2018-04-13 06:18:36,994 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:18:36,995 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:18:36,995 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:18:36,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:18:36,995 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:18:37,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:18:37,004 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:18:37,007 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:18:37,007 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:18:37,008 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:18:37,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:18:37,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:18:37,035 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:18:37,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:18:37,052 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:18:37,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:18:37,054 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 06:18:37,074 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:18:37,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 06:18:37,075 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:18:37,086 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:18:37,087 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:18:37,087 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:18:37,087 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:18:37,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:18:37,096 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:37 [2018-04-13 06:18:37,126 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:18:37,128 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:18:37,129 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:18:37,131 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:18:37,150 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:18:37,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:18:37,153 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:18:37,154 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:18:37,168 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:18:37,168 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:61, output treesize:53 [2018-04-13 06:18:37,199 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:18:37,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 72 [2018-04-13 06:18:37,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 12 treesize of output 11 [2018-04-13 06:18:37,205 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:18:37,212 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:18:37,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 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:18:37,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:18:37,228 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:18:37,231 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:18:37,242 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:18:37,242 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:91, output treesize:75 [2018-04-13 06:18:37,288 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:18:37,295 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 84 [2018-04-13 06:18:37,297 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 20 treesize of output 25 [2018-04-13 06:18:37,297 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:18:37,305 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:18:37,322 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 35 [2018-04-13 06:18:37,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 20 treesize of output 25 [2018-04-13 06:18:37,325 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:18:37,329 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:18:37,347 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:18:37,347 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:117, output treesize:101 [2018-04-13 06:18:41,412 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:18:41,412 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:18:41,413 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 50 [2018-04-13 06:18:41,413 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:18:41,435 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:18:41,436 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:18:41,436 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:18:41,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 49 [2018-04-13 06:18:41,437 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:18:41,453 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:18:41,453 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:103, output treesize:108 [2018-04-13 06:18:41,489 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-04-13 06:18:41,489 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:18:41,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 58 [2018-04-13 06:18:41,519 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:18:41,520 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 52 treesize of output 67 [2018-04-13 06:18:41,520 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:18:41,528 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:18:41,550 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 40 [2018-04-13 06:18:41,552 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:18:41,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-13 06:18:41,553 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 06:18:41,558 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:18:41,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:18:41,572 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:139, output treesize:107 [2018-04-13 06:18:41,627 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:18:41,628 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:18:41,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 67 [2018-04-13 06:18:41,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 14 treesize of output 13 [2018-04-13 06:18:41,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:18:41,641 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:18:41,661 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:18:41,662 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:18:41,668 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 115 [2018-04-13 06:18:41,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-13 06:18:41,670 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:18:41,680 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:18:41,696 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:18:41,696 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:153, output treesize:133 [2018-04-13 06:18:41,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 74 [2018-04-13 06:18:41,805 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 22 treesize of output 29 [2018-04-13 06:18:41,805 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:18:41,813 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:18:41,840 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 145 treesize of output 134 [2018-04-13 06:18:41,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, 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 29 [2018-04-13 06:18:41,843 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:18:41,855 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:18:41,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-13 06:18:41,874 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:180, output treesize:160 [2018-04-13 06:18:50,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 112 [2018-04-13 06:18:50,033 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:18:50,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 57 [2018-04-13 06:18:50,034 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:18:50,048 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 1 [2018-04-13 06:18:50,048 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:18:50,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-13 06:18:50,059 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:18:50,068 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:18:50,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2018-04-13 06:18:50,093 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:18:50,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-13 06:18:50,093 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 06:18:50,101 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 1 [2018-04-13 06:18:50,101 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-13 06:18:50,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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:18:50,105 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-13 06:18:50,106 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:18:50,115 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 06:18:50,116 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:177, output treesize:36 [2018-04-13 06:18:50,192 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 06:18:50,192 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 06:18:50,192 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-13 06:18:50,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-13 06:18:50,192 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-13 06:18:50,192 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=401, Unknown=6, NotChecked=0, Total=506 [2018-04-13 06:18:50,192 INFO L87 Difference]: Start difference. First operand 1452 states and 1835 transitions. Second operand 23 states. [2018-04-13 06:18:52,601 WARN L151 SmtUtils]: Spent 2039ms on a formula simplification. DAG size of input: 68 DAG size of output 59 [2018-04-13 06:18:57,585 WARN L151 SmtUtils]: Spent 4084ms on a formula simplification. DAG size of input: 139 DAG size of output 92 [2018-04-13 06:19:00,705 WARN L151 SmtUtils]: Spent 2062ms on a formula simplification. DAG size of input: 88 DAG size of output 76 [2018-04-13 06:19:01,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:19:01,323 INFO L93 Difference]: Finished difference Result 1908 states and 2378 transitions. [2018-04-13 06:19:01,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-13 06:19:01,323 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 58 [2018-04-13 06:19:01,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:19:01,326 INFO L225 Difference]: With dead ends: 1908 [2018-04-13 06:19:01,326 INFO L226 Difference]: Without dead ends: 1908 [2018-04-13 06:19:01,327 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 632 ImplicationChecksByTransitivity, 22.2s TimeCoverageRelationStatistics Valid=648, Invalid=2102, Unknown=6, NotChecked=0, Total=2756 [2018-04-13 06:19:01,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1908 states. [2018-04-13 06:19:01,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1908 to 1672. [2018-04-13 06:19:01,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2018-04-13 06:19:01,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 2118 transitions. [2018-04-13 06:19:01,338 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 2118 transitions. Word has length 58 [2018-04-13 06:19:01,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:19:01,338 INFO L459 AbstractCegarLoop]: Abstraction has 1672 states and 2118 transitions. [2018-04-13 06:19:01,338 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-13 06:19:01,338 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 2118 transitions. [2018-04-13 06:19:01,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-04-13 06:19:01,338 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:19:01,338 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:19:01,338 INFO L408 AbstractCegarLoop]: === Iteration 43 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:19:01,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1025221117, now seen corresponding path program 2 times [2018-04-13 06:19:01,339 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:19:01,339 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:19:01,339 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:19:01,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:19:01,339 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:19:01,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:19:01,346 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:19:01,349 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:19:01,349 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:19:01,349 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:19:01,350 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 06:19:01,370 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 06:19:01,370 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 06:19:01,373 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:19:01,406 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:01,407 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:01,408 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:19:01,408 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:01,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:01,419 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:30 [2018-04-13 06:19:01,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2018-04-13 06:19:01,453 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:01,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 11 treesize of output 8 [2018-04-13 06:19:01,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:19:01,471 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:01,473 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:01,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, 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:19:01,487 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:19:01,487 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:01,488 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:01,520 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:19:01,520 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:57, output treesize:28 [2018-04-13 06:19:01,556 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:01,583 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 46 [2018-04-13 06:19:01,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:19:01,585 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:01,590 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:01,678 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 34 treesize of output 38 [2018-04-13 06:19:01,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:19:01,681 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:01,705 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:01,721 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:19:01,722 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:76, output treesize:60 [2018-04-13 06:19:01,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 71 [2018-04-13 06:19:01,795 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:01,796 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:19:01,796 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:01,805 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:01,825 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 68 treesize of output 63 [2018-04-13 06:19:01,828 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:01,828 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:19:01,828 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:01,837 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:01,851 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:19:01,851 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:107, output treesize:91 [2018-04-13 06:19:02,023 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:02,023 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:19:02,025 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 87 [2018-04-13 06:19:02,027 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:02,028 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:02,028 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:19:02,028 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 26 treesize of output 35 [2018-04-13 06:19:02,029 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:02,040 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:19:02,040 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 44 treesize of output 39 [2018-04-13 06:19:02,040 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:19:02,046 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:19:02,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 36 [2018-04-13 06:19:02,061 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:19:02,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, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-04-13 06:19:02,062 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:19:02,073 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:02,074 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:02,074 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:19:02,075 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 19 [2018-04-13 06:19:02,075 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:02,080 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:02,086 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:19:02,086 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:118, output treesize:7 [2018-04-13 06:19:02,164 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 06:19:02,164 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 06:19:02,164 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-13 06:19:02,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-13 06:19:02,165 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-13 06:19:02,165 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2018-04-13 06:19:02,165 INFO L87 Difference]: Start difference. First operand 1672 states and 2118 transitions. Second operand 17 states. [2018-04-13 06:19:03,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:19:03,704 INFO L93 Difference]: Finished difference Result 1907 states and 2376 transitions. [2018-04-13 06:19:03,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-13 06:19:03,704 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 59 [2018-04-13 06:19:03,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:19:03,708 INFO L225 Difference]: With dead ends: 1907 [2018-04-13 06:19:03,708 INFO L226 Difference]: Without dead ends: 1907 [2018-04-13 06:19:03,708 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=308, Invalid=1174, Unknown=0, NotChecked=0, Total=1482 [2018-04-13 06:19:03,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1907 states. [2018-04-13 06:19:03,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1907 to 1681. [2018-04-13 06:19:03,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1681 states. [2018-04-13 06:19:03,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1681 states to 1681 states and 2127 transitions. [2018-04-13 06:19:03,719 INFO L78 Accepts]: Start accepts. Automaton has 1681 states and 2127 transitions. Word has length 59 [2018-04-13 06:19:03,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:19:03,719 INFO L459 AbstractCegarLoop]: Abstraction has 1681 states and 2127 transitions. [2018-04-13 06:19:03,719 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-13 06:19:03,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1681 states and 2127 transitions. [2018-04-13 06:19:03,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-13 06:19:03,720 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:19:03,720 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:19:03,720 INFO L408 AbstractCegarLoop]: === Iteration 44 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:19:03,720 INFO L82 PathProgramCache]: Analyzing trace with hash -129556962, now seen corresponding path program 1 times [2018-04-13 06:19:03,720 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:19:03,720 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:19:03,721 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:19:03,721 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 06:19:03,721 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:19:03,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:19:03,728 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:19:03,733 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:19:03,733 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:19:03,733 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:19:03,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:19:03,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:19:03,754 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:19:03,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:19:03,756 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:03,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:03,758 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 06:19:03,776 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:03,776 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:03,777 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:19:03,777 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:03,786 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 06:19:03,787 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:03,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:03,796 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:37 [2018-04-13 06:19:03,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2018-04-13 06:19:03,809 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:03,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:19:03,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, 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:19:03,822 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:03,823 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:03,831 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:19:03,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:19:03,832 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:03,833 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:03,839 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:19:03,839 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:61, output treesize:39 [2018-04-13 06:19:03,861 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:03,865 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 55 [2018-04-13 06:19:03,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:19:03,867 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:03,871 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:03,882 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 27 treesize of output 28 [2018-04-13 06:19:03,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:19:03,884 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:03,886 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:03,894 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:19:03,894 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:77, output treesize:61 [2018-04-13 06:19:03,937 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:19:03,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 83 [2018-04-13 06:19:03,947 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 24 treesize of output 29 [2018-04-13 06:19:03,947 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:03,954 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:03,971 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 61 treesize of output 59 [2018-04-13 06:19:03,973 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 24 treesize of output 29 [2018-04-13 06:19:03,974 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:03,979 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:03,989 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:19:03,990 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:111, output treesize:95 [2018-04-13 06:19:04,020 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 22 treesize of output 12 [2018-04-13 06:19:04,020 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:04,026 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:19:04,027 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:77, output treesize:59 [2018-04-13 06:19:04,193 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:19:04,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 63 [2018-04-13 06:19:04,196 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:19:04,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-13 06:19:04,197 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:04,203 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:19:04,204 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 33 treesize of output 30 [2018-04-13 06:19:04,204 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:19:04,208 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:19:04,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2018-04-13 06:19:04,222 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:19:04,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-04-13 06:19:04,222 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:04,227 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:19:04,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-13 06:19:04,228 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:04,230 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:04,236 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:19:04,237 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:98, output treesize:7 [2018-04-13 06:19:04,291 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 6 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 06:19:04,291 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 06:19:04,291 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-13 06:19:04,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-13 06:19:04,291 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-13 06:19:04,291 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=311, Unknown=8, NotChecked=0, Total=380 [2018-04-13 06:19:04,292 INFO L87 Difference]: Start difference. First operand 1681 states and 2127 transitions. Second operand 20 states. [2018-04-13 06:19:06,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:19:06,209 INFO L93 Difference]: Finished difference Result 1876 states and 2338 transitions. [2018-04-13 06:19:06,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-13 06:19:06,209 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 61 [2018-04-13 06:19:06,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:19:06,212 INFO L225 Difference]: With dead ends: 1876 [2018-04-13 06:19:06,212 INFO L226 Difference]: Without dead ends: 1876 [2018-04-13 06:19:06,213 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=356, Invalid=1514, Unknown=22, NotChecked=0, Total=1892 [2018-04-13 06:19:06,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1876 states. [2018-04-13 06:19:06,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1876 to 1684. [2018-04-13 06:19:06,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1684 states. [2018-04-13 06:19:06,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1684 states and 2130 transitions. [2018-04-13 06:19:06,229 INFO L78 Accepts]: Start accepts. Automaton has 1684 states and 2130 transitions. Word has length 61 [2018-04-13 06:19:06,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:19:06,229 INFO L459 AbstractCegarLoop]: Abstraction has 1684 states and 2130 transitions. [2018-04-13 06:19:06,229 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-13 06:19:06,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 2130 transitions. [2018-04-13 06:19:06,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-13 06:19:06,230 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:19:06,230 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:19:06,230 INFO L408 AbstractCegarLoop]: === Iteration 45 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:19:06,231 INFO L82 PathProgramCache]: Analyzing trace with hash -730653060, now seen corresponding path program 1 times [2018-04-13 06:19:06,231 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:19:06,231 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:19:06,231 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:19:06,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:19:06,231 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:19:06,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:19:06,242 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:19:06,245 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:19:06,246 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:19:06,246 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:19:06,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:19:06,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:19:06,278 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:19:06,315 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:06,316 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:06,316 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:19:06,316 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:06,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:06,322 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-04-13 06:19:06,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2018-04-13 06:19:06,334 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:06,343 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:19:06,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, 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:19:06,344 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:06,345 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:06,352 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:19:06,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 06:19:06,353 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:06,354 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:06,359 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:19:06,359 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:55, output treesize:29 [2018-04-13 06:19:06,381 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:06,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 54 [2018-04-13 06:19:06,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:19:06,387 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:06,391 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:06,405 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 42 treesize of output 46 [2018-04-13 06:19:06,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, 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:19:06,407 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:06,411 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:06,420 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:19:06,420 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:87, output treesize:67 [2018-04-13 06:19:06,457 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 66 treesize of output 59 [2018-04-13 06:19:06,459 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:06,459 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:19:06,459 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:06,467 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:06,482 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 77 treesize of output 63 [2018-04-13 06:19:06,484 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:06,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, 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:19:06,485 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:06,490 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:06,500 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 06:19:06,501 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:120, output treesize:100 [2018-04-13 06:19:06,708 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 58 [2018-04-13 06:19:06,709 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 36 treesize of output 28 [2018-04-13 06:19:06,710 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:19:06,717 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:06,718 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:06,718 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:19:06,719 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 19 [2018-04-13 06:19:06,719 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:06,725 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:19:06,742 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 42 [2018-04-13 06:19:06,744 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:06,744 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:06,744 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:19:06,745 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 19 [2018-04-13 06:19:06,745 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:06,752 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 21 treesize of output 10 [2018-04-13 06:19:06,753 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:06,755 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:06,761 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:19:06,761 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:113, output treesize:7 [2018-04-13 06:19:06,793 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 06:19:06,794 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 06:19:06,794 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-13 06:19:06,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-13 06:19:06,794 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-13 06:19:06,794 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2018-04-13 06:19:06,794 INFO L87 Difference]: Start difference. First operand 1684 states and 2130 transitions. Second operand 17 states. [2018-04-13 06:19:08,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:19:08,289 INFO L93 Difference]: Finished difference Result 2150 states and 2681 transitions. [2018-04-13 06:19:08,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-13 06:19:08,289 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 61 [2018-04-13 06:19:08,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:19:08,292 INFO L225 Difference]: With dead ends: 2150 [2018-04-13 06:19:08,292 INFO L226 Difference]: Without dead ends: 2147 [2018-04-13 06:19:08,293 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=281, Invalid=979, Unknown=0, NotChecked=0, Total=1260 [2018-04-13 06:19:08,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2147 states. [2018-04-13 06:19:08,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2147 to 1688. [2018-04-13 06:19:08,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1688 states. [2018-04-13 06:19:08,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1688 states to 1688 states and 2134 transitions. [2018-04-13 06:19:08,304 INFO L78 Accepts]: Start accepts. Automaton has 1688 states and 2134 transitions. Word has length 61 [2018-04-13 06:19:08,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:19:08,304 INFO L459 AbstractCegarLoop]: Abstraction has 1688 states and 2134 transitions. [2018-04-13 06:19:08,304 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-13 06:19:08,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1688 states and 2134 transitions. [2018-04-13 06:19:08,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-13 06:19:08,305 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:19:08,305 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:19:08,305 INFO L408 AbstractCegarLoop]: === Iteration 46 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:19:08,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1306228245, now seen corresponding path program 1 times [2018-04-13 06:19:08,305 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:19:08,305 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:19:08,305 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:19:08,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:19:08,306 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:19:08,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:19:08,310 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:19:08,334 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-13 06:19:08,334 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:19:08,334 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:19:08,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:19:08,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:19:08,348 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:19:08,370 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-13 06:19:08,370 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 06:19:08,370 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2018-04-13 06:19:08,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-13 06:19:08,371 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-13 06:19:08,371 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-04-13 06:19:08,371 INFO L87 Difference]: Start difference. First operand 1688 states and 2134 transitions. Second operand 9 states. [2018-04-13 06:19:08,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:19:08,480 INFO L93 Difference]: Finished difference Result 1748 states and 2195 transitions. [2018-04-13 06:19:08,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-13 06:19:08,481 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2018-04-13 06:19:08,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:19:08,483 INFO L225 Difference]: With dead ends: 1748 [2018-04-13 06:19:08,484 INFO L226 Difference]: Without dead ends: 1748 [2018-04-13 06:19:08,484 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2018-04-13 06:19:08,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1748 states. [2018-04-13 06:19:08,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1748 to 1688. [2018-04-13 06:19:08,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1688 states. [2018-04-13 06:19:08,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1688 states to 1688 states and 2132 transitions. [2018-04-13 06:19:08,497 INFO L78 Accepts]: Start accepts. Automaton has 1688 states and 2132 transitions. Word has length 63 [2018-04-13 06:19:08,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:19:08,497 INFO L459 AbstractCegarLoop]: Abstraction has 1688 states and 2132 transitions. [2018-04-13 06:19:08,497 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-13 06:19:08,497 INFO L276 IsEmpty]: Start isEmpty. Operand 1688 states and 2132 transitions. [2018-04-13 06:19:08,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-13 06:19:08,498 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:19:08,498 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:19:08,498 INFO L408 AbstractCegarLoop]: === Iteration 47 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:19:08,498 INFO L82 PathProgramCache]: Analyzing trace with hash 397506269, now seen corresponding path program 2 times [2018-04-13 06:19:08,498 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:19:08,498 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:19:08,498 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:19:08,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:19:08,498 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:19:08,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:19:08,504 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:19:08,508 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:19:08,508 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:19:08,508 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:19:08,508 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 06:19:08,522 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 06:19:08,523 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 06:19:08,524 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:19:08,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 6 treesize of output 5 [2018-04-13 06:19:08,534 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:08,538 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:08,538 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 06:19:08,551 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:08,551 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:08,551 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:19:08,552 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:08,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:08,555 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-04-13 06:19:08,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 13 treesize of output 10 [2018-04-13 06:19:08,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 06:19:08,563 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:08,564 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:08,571 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:19:08,572 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:19:08,572 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:08,573 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:08,578 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:19:08,578 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:29 [2018-04-13 06:19:08,600 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:08,604 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 42 treesize of output 46 [2018-04-13 06:19:08,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:19:08,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:08,611 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:08,621 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:08,625 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 44 [2018-04-13 06:19:08,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-13 06:19:08,627 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:08,630 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:08,639 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:19:08,639 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:87, output treesize:67 [2018-04-13 06:19:08,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 87 [2018-04-13 06:19:08,677 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:08,677 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:19:08,678 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:08,693 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:08,707 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 89 treesize of output 75 [2018-04-13 06:19:08,709 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:08,709 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:19:08,709 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:08,715 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:08,726 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:19:08,726 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:123, output treesize:103 [2018-04-13 06:19:08,965 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:08,966 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:08,966 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 99 treesize of output 88 [2018-04-13 06:19:08,968 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:08,975 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 42 [2018-04-13 06:19:08,976 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:19:08,985 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 52 treesize of output 42 [2018-04-13 06:19:08,986 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:19:08,991 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:19:09,000 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 38 [2018-04-13 06:19:09,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 14 [2018-04-13 06:19:09,002 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:09,006 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:09,007 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 8 [2018-04-13 06:19:09,007 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:09,009 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:09,014 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:19:09,014 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:116, output treesize:7 [2018-04-13 06:19:09,052 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 06:19:09,053 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 06:19:09,053 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-13 06:19:09,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-13 06:19:09,053 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-13 06:19:09,053 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2018-04-13 06:19:09,053 INFO L87 Difference]: Start difference. First operand 1688 states and 2132 transitions. Second operand 19 states. [2018-04-13 06:19:09,978 WARN L151 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 96 DAG size of output 65 [2018-04-13 06:19:10,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:19:10,870 INFO L93 Difference]: Finished difference Result 2175 states and 2714 transitions. [2018-04-13 06:19:10,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-13 06:19:10,870 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 63 [2018-04-13 06:19:10,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:19:10,872 INFO L225 Difference]: With dead ends: 2175 [2018-04-13 06:19:10,872 INFO L226 Difference]: Without dead ends: 2175 [2018-04-13 06:19:10,873 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=328, Invalid=1478, Unknown=0, NotChecked=0, Total=1806 [2018-04-13 06:19:10,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2175 states. [2018-04-13 06:19:10,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2175 to 1684. [2018-04-13 06:19:10,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1684 states. [2018-04-13 06:19:10,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1684 states and 2128 transitions. [2018-04-13 06:19:10,884 INFO L78 Accepts]: Start accepts. Automaton has 1684 states and 2128 transitions. Word has length 63 [2018-04-13 06:19:10,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:19:10,885 INFO L459 AbstractCegarLoop]: Abstraction has 1684 states and 2128 transitions. [2018-04-13 06:19:10,885 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-13 06:19:10,885 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 2128 transitions. [2018-04-13 06:19:10,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-13 06:19:10,885 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:19:10,885 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:19:10,886 INFO L408 AbstractCegarLoop]: === Iteration 48 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:19:10,886 INFO L82 PathProgramCache]: Analyzing trace with hash 493409295, now seen corresponding path program 1 times [2018-04-13 06:19:10,886 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:19:10,886 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:19:10,887 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:19:10,887 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 06:19:10,887 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:19:10,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:19:10,895 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:19:10,899 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:19:10,899 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:19:10,899 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:19:10,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:19:10,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:19:10,923 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:19:10,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 06:19:10,925 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:10,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:19:10,928 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:10,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:10,931 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 06:19:10,954 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:10,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 06:19:10,954 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:10,962 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:10,963 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:10,963 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:19:10,964 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:10,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:10,970 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:34 [2018-04-13 06:19:10,981 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:19:10,982 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:19:10,982 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:10,983 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:10,991 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:19:10,991 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:46 [2018-04-13 06:19:11,018 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:11,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 53 [2018-04-13 06:19:11,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:19:11,023 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:11,030 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:11,038 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:19:11,039 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:57 [2018-04-13 06:19:11,091 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:19:11,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 52 [2018-04-13 06:19:11,100 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 20 treesize of output 25 [2018-04-13 06:19:11,101 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:11,107 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:11,118 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:19:11,118 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:78, output treesize:70 [2018-04-13 06:19:17,161 WARN L151 SmtUtils]: Spent 2028ms on a formula simplification. DAG size of input: 37 DAG size of output 33 [2018-04-13 06:19:17,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, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 12 [2018-04-13 06:19:17,164 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:17,169 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:19:17,170 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:63, output treesize:45 [2018-04-13 06:19:17,298 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 45 treesize of output 36 [2018-04-13 06:19:17,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-13 06:19:17,299 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:17,304 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:19:17,304 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:19:17,305 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 24 treesize of output 22 [2018-04-13 06:19:17,305 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:17,308 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:17,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:17,316 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:65, output treesize:18 [2018-04-13 06:19:17,350 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:17,351 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:19:17,351 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:17,354 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:19:17,354 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2018-04-13 06:19:17,399 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 06:19:17,399 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 06:19:17,399 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-13 06:19:17,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-13 06:19:17,400 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-13 06:19:17,400 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=350, Unknown=2, NotChecked=0, Total=420 [2018-04-13 06:19:17,400 INFO L87 Difference]: Start difference. First operand 1684 states and 2128 transitions. Second operand 21 states. [2018-04-13 06:19:19,831 WARN L151 SmtUtils]: Spent 2031ms on a formula simplification. DAG size of input: 57 DAG size of output 51 [2018-04-13 06:19:21,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:19:21,203 INFO L93 Difference]: Finished difference Result 1929 states and 2408 transitions. [2018-04-13 06:19:21,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-13 06:19:21,203 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 66 [2018-04-13 06:19:21,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:19:21,205 INFO L225 Difference]: With dead ends: 1929 [2018-04-13 06:19:21,205 INFO L226 Difference]: Without dead ends: 1929 [2018-04-13 06:19:21,206 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=337, Invalid=1641, Unknown=2, NotChecked=0, Total=1980 [2018-04-13 06:19:21,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1929 states. [2018-04-13 06:19:21,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1929 to 1699. [2018-04-13 06:19:21,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1699 states. [2018-04-13 06:19:21,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1699 states and 2144 transitions. [2018-04-13 06:19:21,218 INFO L78 Accepts]: Start accepts. Automaton has 1699 states and 2144 transitions. Word has length 66 [2018-04-13 06:19:21,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:19:21,218 INFO L459 AbstractCegarLoop]: Abstraction has 1699 states and 2144 transitions. [2018-04-13 06:19:21,218 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-13 06:19:21,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 2144 transitions. [2018-04-13 06:19:21,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-13 06:19:21,219 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:19:21,219 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:19:21,219 INFO L408 AbstractCegarLoop]: === Iteration 49 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:19:21,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1688668822, now seen corresponding path program 1 times [2018-04-13 06:19:21,219 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:19:21,219 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:19:21,220 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:19:21,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:19:21,220 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:19:21,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:19:21,228 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:19:21,230 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:19:21,231 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:19:21,231 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:19:21,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:19:21,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:19:21,263 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:19:21,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 6 treesize of output 5 [2018-04-13 06:19:21,265 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:21,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:21,266 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-13 06:19:21,283 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:21,284 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:21,284 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:19:21,285 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:21,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 06:19:21,294 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:21,302 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:19:21,302 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:34 [2018-04-13 06:19:21,355 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:21,356 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:21,357 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:21,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 37 [2018-04-13 06:19:21,357 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:21,372 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 28 [2018-04-13 06:19:21,372 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:21,385 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:19:21,385 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:55 [2018-04-13 06:19:21,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-13 06:19:21,413 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:21,430 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:19:21,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 06:19:21,432 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:21,433 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:21,448 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:19:21,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, 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:19:21,449 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:21,451 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:21,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:19:21,463 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:86, output treesize:64 [2018-04-13 06:19:21,513 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:21,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 75 [2018-04-13 06:19:21,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 14 treesize of output 13 [2018-04-13 06:19:21,518 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:21,524 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:21,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 46 [2018-04-13 06:19:21,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:19:21,547 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:21,551 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:21,565 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:19:21,565 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:122, output treesize:102 [2018-04-13 06:19:21,628 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 120 treesize of output 106 [2018-04-13 06:19:21,631 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:21,632 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:19:21,632 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:21,645 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:21,674 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 84 treesize of output 77 [2018-04-13 06:19:21,677 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:21,677 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:19:21,677 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:21,687 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:21,713 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:19:21,713 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:158, output treesize:138 [2018-04-13 06:19:21,783 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 29 treesize of output 28 [2018-04-13 06:19:21,783 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:21,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:19:21,796 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:145, output treesize:106 [2018-04-13 06:19:21,888 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 121 treesize of output 96 [2018-04-13 06:19:21,889 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 58 treesize of output 42 [2018-04-13 06:19:21,889 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:19:21,899 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:21,899 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 32 treesize of output 16 [2018-04-13 06:19:21,899 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:21,905 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:19:21,917 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 56 treesize of output 46 [2018-04-13 06:19:21,919 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:21,920 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 28 treesize of output 14 [2018-04-13 06:19:21,920 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:21,924 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:19:21,925 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:21,927 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:21,932 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:19:21,932 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:148, output treesize:7 [2018-04-13 06:19:21,995 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 06:19:21,995 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 06:19:21,995 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-13 06:19:21,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-13 06:19:21,995 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-13 06:19:21,996 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=286, Unknown=1, NotChecked=0, Total=342 [2018-04-13 06:19:21,996 INFO L87 Difference]: Start difference. First operand 1699 states and 2144 transitions. Second operand 19 states. [2018-04-13 06:19:25,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:19:25,816 INFO L93 Difference]: Finished difference Result 2523 states and 3142 transitions. [2018-04-13 06:19:25,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-13 06:19:25,817 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 66 [2018-04-13 06:19:25,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:19:25,820 INFO L225 Difference]: With dead ends: 2523 [2018-04-13 06:19:25,820 INFO L226 Difference]: Without dead ends: 2523 [2018-04-13 06:19:25,821 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=605, Invalid=2149, Unknown=2, NotChecked=0, Total=2756 [2018-04-13 06:19:25,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2523 states. [2018-04-13 06:19:25,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2523 to 1928. [2018-04-13 06:19:25,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1928 states. [2018-04-13 06:19:25,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2437 transitions. [2018-04-13 06:19:25,843 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 2437 transitions. Word has length 66 [2018-04-13 06:19:25,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:19:25,843 INFO L459 AbstractCegarLoop]: Abstraction has 1928 states and 2437 transitions. [2018-04-13 06:19:25,843 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-13 06:19:25,843 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 2437 transitions. [2018-04-13 06:19:25,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-13 06:19:25,844 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:19:25,844 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:19:25,845 INFO L408 AbstractCegarLoop]: === Iteration 50 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:19:25,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1645242588, now seen corresponding path program 1 times [2018-04-13 06:19:25,845 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:19:25,845 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:19:25,845 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:19:25,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:19:25,846 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:19:25,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:19:25,856 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:19:25,860 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:19:25,860 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:19:25,860 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:19:25,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:19:25,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:19:25,915 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:19:25,949 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:25,958 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:25,959 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:19:25,960 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:25,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:25,971 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:30 [2018-04-13 06:19:25,992 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:19:25,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, 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:19:25,994 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:25,996 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:26,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-13 06:19:26,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:19:26,012 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:26,013 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:26,022 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:19:26,023 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:54, output treesize:42 [2018-04-13 06:19:26,057 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:26,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 63 [2018-04-13 06:19:26,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-13 06:19:26,063 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:26,070 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:26,086 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:26,090 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 34 treesize of output 38 [2018-04-13 06:19:26,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 12 treesize of output 11 [2018-04-13 06:19:26,092 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:26,096 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:26,110 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:19:26,110 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:90, output treesize:74 [2018-04-13 06:19:26,161 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:26,161 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:19:26,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 63 [2018-04-13 06:19:26,170 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:26,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 31 [2018-04-13 06:19:26,171 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:26,179 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:26,200 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:26,200 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:19:26,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 75 [2018-04-13 06:19:26,208 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:26,208 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 20 treesize of output 31 [2018-04-13 06:19:26,209 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:26,216 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:26,232 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:19:26,232 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:123, output treesize:107 [2018-04-13 06:19:26,285 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:26,286 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:26,287 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:26,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 53 [2018-04-13 06:19:26,287 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:26,307 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:19:26,307 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:121, output treesize:127 [2018-04-13 06:19:26,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-04-13 06:19:26,354 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:26,388 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:26,392 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 59 treesize of output 61 [2018-04-13 06:19:26,395 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:26,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, 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 40 [2018-04-13 06:19:26,397 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:26,410 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:26,434 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:26,438 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 73 [2018-04-13 06:19:26,440 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:26,440 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 69 treesize of output 83 [2018-04-13 06:19:26,440 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:26,449 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:26,468 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 06:19:26,468 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:158, output treesize:126 [2018-04-13 06:19:26,536 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:26,536 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:26,544 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 113 [2018-04-13 06:19:26,546 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-13 06:19:26,546 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:26,560 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:26,589 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:26,590 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:26,597 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 113 [2018-04-13 06:19:26,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:19:26,599 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:26,609 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:26,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-13 06:19:26,633 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:184, output treesize:164 [2018-04-13 06:19:26,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 126 [2018-04-13 06:19:26,770 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:26,771 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:19:26,771 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:26,788 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:26,826 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 147 treesize of output 132 [2018-04-13 06:19:26,838 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:26,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 35 [2018-04-13 06:19:26,839 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:26,852 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:26,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-13 06:19:26,878 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:217, output treesize:197 [2018-04-13 06:19:27,307 WARN L151 SmtUtils]: Spent 161ms on a formula simplification. DAG size of input: 70 DAG size of output 70 [2018-04-13 06:19:27,467 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:27,468 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:27,468 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:27,469 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:27,470 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 133 [2018-04-13 06:19:27,475 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:27,481 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 31 [2018-04-13 06:19:27,482 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:19:27,502 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:27,503 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:27,504 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:19:27,504 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 19 [2018-04-13 06:19:27,504 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:27,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 62 [2018-04-13 06:19:27,528 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 06:19:27,540 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:19:27,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 83 [2018-04-13 06:19:27,573 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:27,574 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:27,574 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:19:27,575 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 19 [2018-04-13 06:19:27,575 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:27,592 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:27,592 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:19:27,592 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:27,602 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:27,603 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:19:27,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 19 [2018-04-13 06:19:27,603 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:27,609 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:27,621 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:27,621 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 9 variables, input treesize:219, output treesize:7 [2018-04-13 06:19:27,694 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 14 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 06:19:27,694 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 06:19:27,694 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-13 06:19:27,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-13 06:19:27,695 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-13 06:19:27,695 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=590, Unknown=0, NotChecked=0, Total=702 [2018-04-13 06:19:27,695 INFO L87 Difference]: Start difference. First operand 1928 states and 2437 transitions. Second operand 27 states. [2018-04-13 06:19:29,046 WARN L151 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 110 DAG size of output 94 [2018-04-13 06:19:29,459 WARN L151 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 125 DAG size of output 93 [2018-04-13 06:19:29,763 WARN L151 SmtUtils]: Spent 139ms on a formula simplification. DAG size of input: 179 DAG size of output 107 [2018-04-13 06:19:30,029 WARN L151 SmtUtils]: Spent 133ms on a formula simplification. DAG size of input: 177 DAG size of output 105 [2018-04-13 06:19:30,481 WARN L151 SmtUtils]: Spent 150ms on a formula simplification. DAG size of input: 181 DAG size of output 109 [2018-04-13 06:19:34,653 WARN L151 SmtUtils]: Spent 4065ms on a formula simplification. DAG size of input: 135 DAG size of output 82 [2018-04-13 06:19:35,014 WARN L151 SmtUtils]: Spent 239ms on a formula simplification. DAG size of input: 188 DAG size of output 116 [2018-04-13 06:19:35,340 WARN L151 SmtUtils]: Spent 207ms on a formula simplification. DAG size of input: 188 DAG size of output 108 [2018-04-13 06:19:35,719 WARN L151 SmtUtils]: Spent 213ms on a formula simplification. DAG size of input: 190 DAG size of output 112 [2018-04-13 06:19:36,238 WARN L151 SmtUtils]: Spent 148ms on a formula simplification. DAG size of input: 183 DAG size of output 107 [2018-04-13 06:19:36,476 WARN L151 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 175 DAG size of output 103 [2018-04-13 06:19:36,832 WARN L151 SmtUtils]: Spent 175ms on a formula simplification. DAG size of input: 181 DAG size of output 122 [2018-04-13 06:19:38,031 WARN L148 SmtUtils]: Spent 629ms on a formula simplification that was a NOOP. DAG size: 68 [2018-04-13 06:19:40,908 WARN L151 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 143 DAG size of output 90 [2018-04-13 06:19:41,204 WARN L151 SmtUtils]: Spent 192ms on a formula simplification. DAG size of input: 150 DAG size of output 97 [2018-04-13 06:19:41,437 WARN L151 SmtUtils]: Spent 154ms on a formula simplification. DAG size of input: 150 DAG size of output 89 [2018-04-13 06:19:41,682 WARN L151 SmtUtils]: Spent 162ms on a formula simplification. DAG size of input: 152 DAG size of output 94 [2018-04-13 06:19:41,920 WARN L151 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 145 DAG size of output 88 [2018-04-13 06:19:42,299 WARN L151 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 143 DAG size of output 103 [2018-04-13 06:19:42,488 WARN L151 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 146 DAG size of output 93 [2018-04-13 06:19:42,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:19:42,583 INFO L93 Difference]: Finished difference Result 2123 states and 2628 transitions. [2018-04-13 06:19:42,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-04-13 06:19:42,584 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 66 [2018-04-13 06:19:42,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:19:42,585 INFO L225 Difference]: With dead ends: 2123 [2018-04-13 06:19:42,586 INFO L226 Difference]: Without dead ends: 2123 [2018-04-13 06:19:42,586 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1126 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=1057, Invalid=4055, Unknown=0, NotChecked=0, Total=5112 [2018-04-13 06:19:42,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2123 states. [2018-04-13 06:19:42,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2123 to 1835. [2018-04-13 06:19:42,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1835 states. [2018-04-13 06:19:42,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1835 states to 1835 states and 2290 transitions. [2018-04-13 06:19:42,604 INFO L78 Accepts]: Start accepts. Automaton has 1835 states and 2290 transitions. Word has length 66 [2018-04-13 06:19:42,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:19:42,605 INFO L459 AbstractCegarLoop]: Abstraction has 1835 states and 2290 transitions. [2018-04-13 06:19:42,605 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-13 06:19:42,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1835 states and 2290 transitions. [2018-04-13 06:19:42,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-04-13 06:19:42,606 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:19:42,606 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:19:42,606 INFO L408 AbstractCegarLoop]: === Iteration 51 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:19:42,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1970404721, now seen corresponding path program 2 times [2018-04-13 06:19:42,606 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:19:42,606 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:19:42,607 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:19:42,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:19:42,607 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:19:42,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:19:42,621 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:19:42,625 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:19:42,626 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:19:42,626 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:19:42,626 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 06:19:42,666 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 06:19:42,667 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 06:19:42,670 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:19:42,693 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:42,694 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:42,694 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:19:42,695 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:42,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:42,704 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-04-13 06:19:42,720 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:19:42,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 8 treesize of output 7 [2018-04-13 06:19:42,723 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:42,725 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:42,740 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:19:42,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:19:42,741 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:42,743 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:42,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:42,754 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:51, output treesize:39 [2018-04-13 06:19:42,807 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:42,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 63 [2018-04-13 06:19:42,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:19:42,814 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:42,821 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:42,836 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:42,840 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 34 treesize of output 38 [2018-04-13 06:19:42,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:19:42,842 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:42,847 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:42,860 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:19:42,860 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:87, output treesize:71 [2018-04-13 06:19:42,912 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:42,912 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:19:42,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 83 [2018-04-13 06:19:42,922 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:42,922 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 20 treesize of output 31 [2018-04-13 06:19:42,923 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:42,934 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:42,953 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:42,958 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 54 treesize of output 52 [2018-04-13 06:19:42,960 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:42,961 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 20 treesize of output 31 [2018-04-13 06:19:42,961 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:42,968 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:42,982 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:19:42,983 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:120, output treesize:104 [2018-04-13 06:19:43,050 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:43,051 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:43,084 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:43,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, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 50 [2018-04-13 06:19:43,084 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:43,108 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:19:43,109 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:115, output treesize:121 [2018-04-13 06:19:43,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-04-13 06:19:43,171 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:43,198 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:43,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 73 [2018-04-13 06:19:43,206 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:43,206 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 69 treesize of output 83 [2018-04-13 06:19:43,206 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:43,216 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:43,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 61 [2018-04-13 06:19:43,243 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:43,244 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 26 treesize of output 40 [2018-04-13 06:19:43,245 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:43,254 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:43,271 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 06:19:43,271 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:152, output treesize:114 [2018-04-13 06:19:43,367 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:43,368 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:43,376 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 123 [2018-04-13 06:19:43,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 14 treesize of output 13 [2018-04-13 06:19:43,378 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:43,394 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:43,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 92 [2018-04-13 06:19:43,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:19:43,422 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:43,432 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:43,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-13 06:19:43,449 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:160, output treesize:140 [2018-04-13 06:19:43,572 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 157 treesize of output 142 [2018-04-13 06:19:43,574 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 22 treesize of output 29 [2018-04-13 06:19:43,575 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:43,588 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:43,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 99 [2018-04-13 06:19:43,616 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 22 treesize of output 29 [2018-04-13 06:19:43,616 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:43,626 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:43,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-13 06:19:43,645 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:184, output treesize:164 [2018-04-13 06:19:49,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 103 [2018-04-13 06:19:49,884 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:49,885 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:19:49,885 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 32 [2018-04-13 06:19:49,885 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:49,899 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 49 [2018-04-13 06:19:49,899 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 06:19:49,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-13 06:19:49,908 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:49,915 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 06:19:49,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 59 [2018-04-13 06:19:49,929 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:19:49,929 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:49,938 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:19:49,938 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:19:49,938 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 20 treesize of output 24 [2018-04-13 06:19:49,938 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:49,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 13 [2018-04-13 06:19:49,944 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-13 06:19:49,947 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:19:49,953 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:19:49,953 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:157, output treesize:10 [2018-04-13 06:19:50,003 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 06:19:50,004 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 06:19:50,004 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-13 06:19:50,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-13 06:19:50,004 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-13 06:19:50,004 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=375, Unknown=3, NotChecked=0, Total=462 [2018-04-13 06:19:50,005 INFO L87 Difference]: Start difference. First operand 1835 states and 2290 transitions. Second operand 22 states. [2018-04-13 06:19:51,100 WARN L151 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 91 DAG size of output 75 [2018-04-13 06:20:15,556 WARN L151 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 112 DAG size of output 84 [2018-04-13 06:20:17,729 WARN L151 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 157 DAG size of output 84 [2018-04-13 06:20:23,948 WARN L151 SmtUtils]: Spent 151ms on a formula simplification. DAG size of input: 149 DAG size of output 82 [2018-04-13 06:20:49,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:20:49,406 INFO L93 Difference]: Finished difference Result 2087 states and 2574 transitions. [2018-04-13 06:20:49,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-13 06:20:49,407 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 67 [2018-04-13 06:20:49,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:20:49,408 INFO L225 Difference]: With dead ends: 2087 [2018-04-13 06:20:49,408 INFO L226 Difference]: Without dead ends: 2083 [2018-04-13 06:20:49,409 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 52.9s TimeCoverageRelationStatistics Valid=498, Invalid=1733, Unknown=25, NotChecked=0, Total=2256 [2018-04-13 06:20:49,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2083 states. [2018-04-13 06:20:49,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2083 to 1849. [2018-04-13 06:20:49,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1849 states. [2018-04-13 06:20:49,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1849 states to 1849 states and 2307 transitions. [2018-04-13 06:20:49,421 INFO L78 Accepts]: Start accepts. Automaton has 1849 states and 2307 transitions. Word has length 67 [2018-04-13 06:20:49,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:20:49,422 INFO L459 AbstractCegarLoop]: Abstraction has 1849 states and 2307 transitions. [2018-04-13 06:20:49,422 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-13 06:20:49,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1849 states and 2307 transitions. [2018-04-13 06:20:49,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-04-13 06:20:49,422 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:20:49,422 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:49,422 INFO L408 AbstractCegarLoop]: === Iteration 52 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:20:49,423 INFO L82 PathProgramCache]: Analyzing trace with hash -2136794448, now seen corresponding path program 1 times [2018-04-13 06:20:49,423 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:20:49,423 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:20:49,423 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:20:49,423 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 06:20:49,423 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:20:49,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:20:49,437 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:20:49,549 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-13 06:20:49,549 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:20:49,549 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:20:49,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:20:49,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:20:49,569 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:20:49,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:20:49,572 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:20:49,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:20:49,587 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:20:49,590 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:20:49,590 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 06:20:49,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 7 [2018-04-13 06:20:49,788 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:20:49,796 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:20:49,796 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:20:49,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-13 06:20:49,797 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:20:49,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:20:49,803 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:34 [2018-04-13 06:20:49,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 21 [2018-04-13 06:20:49,822 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:20:49,823 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 21 treesize of output 30 [2018-04-13 06:20:49,823 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:20:49,826 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:20:49,834 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:20:49,834 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:45 [2018-04-13 06:20:49,885 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:20:49,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 55 [2018-04-13 06:20:49,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:20:49,890 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:20:49,894 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:20:49,902 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:20:49,902 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:68, output treesize:58 [2018-04-13 06:20:49,988 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 49 [2018-04-13 06:20:49,990 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 22 treesize of output 29 [2018-04-13 06:20:49,990 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:20:49,995 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:20:50,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-13 06:20:50,004 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:80, output treesize:70 [2018-04-13 06:20:54,192 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 60 treesize of output 43 [2018-04-13 06:20:54,195 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:20:54,196 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:20:54,196 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:20:54,197 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 24 treesize of output 26 [2018-04-13 06:20:54,198 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:20:54,205 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 1 [2018-04-13 06:20:54,205 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:20:54,208 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:20:54,214 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:20:54,215 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:81, output treesize:16 [2018-04-13 06:20:54,262 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:20:54,263 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:20:54,263 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:20:54,263 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:20:54,268 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:20:54,268 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:17 [2018-04-13 06:20:54,346 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 06:20:54,346 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 06:20:54,346 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 24] total 33 [2018-04-13 06:20:54,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-13 06:20:54,346 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-13 06:20:54,346 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=949, Unknown=3, NotChecked=0, Total=1056 [2018-04-13 06:20:54,347 INFO L87 Difference]: Start difference. First operand 1849 states and 2307 transitions. Second operand 33 states. [2018-04-13 06:21:23,617 WARN L151 SmtUtils]: Spent 4041ms on a formula simplification. DAG size of input: 63 DAG size of output 56 Received shutdown request... [2018-04-13 06:22:58,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-04-13 06:22:58,274 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-13 06:22:58,312 WARN L197 ceAbstractionStarter]: Timeout [2018-04-13 06:22:58,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 06:22:58 BoogieIcfgContainer [2018-04-13 06:22:58,312 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-13 06:22:58,313 INFO L168 Benchmark]: Toolchain (without parser) took 854696.67 ms. Allocated memory was 399.0 MB in the beginning and 556.8 MB in the end (delta: 157.8 MB). Free memory was 335.4 MB in the beginning and 439.9 MB in the end (delta: -104.5 MB). Peak memory consumption was 53.3 MB. Max. memory is 5.3 GB. [2018-04-13 06:22:58,314 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 399.0 MB. Free memory is still 362.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-13 06:22:58,314 INFO L168 Benchmark]: CACSL2BoogieTranslator took 231.63 ms. Allocated memory is still 399.0 MB. Free memory was 335.4 MB in the beginning and 310.1 MB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 5.3 GB. [2018-04-13 06:22:58,314 INFO L168 Benchmark]: Boogie Preprocessor took 42.68 ms. Allocated memory is still 399.0 MB. Free memory was 310.1 MB in the beginning and 307.5 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:22:58,314 INFO L168 Benchmark]: RCFGBuilder took 530.44 ms. Allocated memory was 399.0 MB in the beginning and 606.6 MB in the end (delta: 207.6 MB). Free memory was 307.5 MB in the beginning and 526.5 MB in the end (delta: -219.0 MB). Peak memory consumption was 23.1 MB. Max. memory is 5.3 GB. [2018-04-13 06:22:58,315 INFO L168 Benchmark]: TraceAbstraction took 853888.66 ms. Allocated memory was 606.6 MB in the beginning and 556.8 MB in the end (delta: -49.8 MB). Free memory was 524.7 MB in the beginning and 439.9 MB in the end (delta: 84.9 MB). Peak memory consumption was 35.0 MB. Max. memory is 5.3 GB. [2018-04-13 06:22:58,316 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.17 ms. Allocated memory is still 399.0 MB. Free memory is still 362.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 231.63 ms. Allocated memory is still 399.0 MB. Free memory was 335.4 MB in the beginning and 310.1 MB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 42.68 ms. Allocated memory is still 399.0 MB. Free memory was 310.1 MB in the beginning and 307.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 530.44 ms. Allocated memory was 399.0 MB in the beginning and 606.6 MB in the end (delta: 207.6 MB). Free memory was 307.5 MB in the beginning and 526.5 MB in the end (delta: -219.0 MB). Peak memory consumption was 23.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 853888.66 ms. Allocated memory was 606.6 MB in the beginning and 556.8 MB in the end (delta: -49.8 MB). Free memory was 524.7 MB in the beginning and 439.9 MB in the end (delta: 84.9 MB). Peak memory consumption was 35.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 663]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 56 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (629 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 642]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 56 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (629 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 56 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (629 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 639]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 56 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (629 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 652]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 56 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (629 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 626]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 626). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 56 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (629 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 56 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (629 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 660]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 56 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (629 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 56 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (629 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 627]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 627). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 56 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (629 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 666]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 666). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 56 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (629 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 637]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 56 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (629 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 661]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 56 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (629 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 636]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 56 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (629 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 630]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 56 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (629 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 644]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 56 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (629 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 56 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (629 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 655]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 655). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 56 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (629 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 56 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (629 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 634]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 56 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (629 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 641]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 56 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (629 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 657]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 56 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (629 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 634]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 56 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (629 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 655]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 655). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 56 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (629 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 630]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 56 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (629 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 663]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 56 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (629 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 652]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 56 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (629 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 630]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 56 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (629 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 636]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 56 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (629 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 652]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 56 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (629 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 56 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (629 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 644]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 56 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (629 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 639]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 56 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (629 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 654]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 654). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 56 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (629 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 661]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 56 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (629 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 652]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 56 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (629 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 56 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (629 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 641]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 56 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (629 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 627]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 627). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 56 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (629 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 657]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 56 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (629 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 56 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (629 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 639]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 56 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (629 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 644]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 56 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (629 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 642]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 56 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (629 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 626]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 626). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 56 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (629 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 620]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 620). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 56 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (629 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 632]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 632). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 56 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (629 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 666]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 666). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 56 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (629 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 630]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 56 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (629 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 639]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 56 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (629 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 632]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 632). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 56 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (629 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 644]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 56 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (629 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 660]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 56 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (629 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 637]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 56 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (629 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 654]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 654). Cancelled while BasicCegarLoop was constructing difference of abstraction (1849states) and interpolant automaton (currently 56 states, 33 states before enhancement), while ReachableStatesComputation was computing reachable states (629 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 132 locations, 55 error locations. TIMEOUT Result, 853.8s OverallTime, 52 OverallIterations, 4 TraceHistogramMax, 706.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5834 SDtfs, 26116 SDslu, 31464 SDs, 0 SdLazy, 32570 SolverSat, 2320 SolverUnsat, 223 SolverUnknown, 0 SolverNotchecked, 204.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2618 GetRequests, 1349 SyntacticMatches, 16 SemanticMatches, 1253 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 10934 ImplicationChecksByTransitivity, 611.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1928occurred in iteration=49, 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, 51 MinimizatonAttempts, 8324 StatesRemovedByMinimization, 49 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 145.7s InterpolantComputationTime, 4007 NumberOfCodeBlocks, 4007 NumberOfCodeBlocksAsserted, 90 NumberOfCheckSat, 2451 ConstructedInterpolants, 649 QuantifiedInterpolants, 4267774 SizeOfPredicates, 561 NumberOfNonLiveVariables, 7263 ConjunctsInSsa, 1266 ConjunctsInUnsatCore, 57 InterpolantComputations, 25 PerfectInterpolantSequences, 209/410 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_cnstr_true-valid-memsafety_false-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-13_06-22-58-323.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_cnstr_true-valid-memsafety_false-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-13_06-22-58-323.csv Completed graceful shutdown