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/array-memsafety/add_last-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-408c70d-m [2018-04-13 03:40:20,614 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-13 03:40:20,616 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-13 03:40:20,627 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-13 03:40:20,627 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-13 03:40:20,628 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-13 03:40:20,629 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-13 03:40:20,630 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-13 03:40:20,632 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-13 03:40:20,632 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-13 03:40:20,633 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-13 03:40:20,633 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-13 03:40:20,634 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-13 03:40:20,635 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-13 03:40:20,636 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-13 03:40:20,638 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-13 03:40:20,639 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-13 03:40:20,641 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-13 03:40:20,642 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-13 03:40:20,643 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-13 03:40:20,644 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-13 03:40:20,644 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-13 03:40:20,645 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-13 03:40:20,646 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-13 03:40:20,646 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-13 03:40:20,647 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-13 03:40:20,648 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-13 03:40:20,648 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-13 03:40:20,649 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-13 03:40:20,649 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-13 03:40:20,649 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-13 03:40:20,649 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 03:40:20,659 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-13 03:40:20,659 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-13 03:40:20,660 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-13 03:40:20,660 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-13 03:40:20,660 INFO L133 SettingsManager]: * Use SBE=true [2018-04-13 03:40:20,660 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-13 03:40:20,660 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-13 03:40:20,660 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-13 03:40:20,660 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-13 03:40:20,660 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-13 03:40:20,661 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-13 03:40:20,661 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-13 03:40:20,661 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-13 03:40:20,661 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-13 03:40:20,661 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-13 03:40:20,661 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-13 03:40:20,661 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-13 03:40:20,661 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-13 03:40:20,661 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-13 03:40:20,661 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-13 03:40:20,662 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-13 03:40:20,662 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-13 03:40:20,662 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-13 03:40:20,662 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 03:40:20,688 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-13 03:40:20,696 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-13 03:40:20,698 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-13 03:40:20,699 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-13 03:40:20,700 INFO L276 PluginConnector]: CDTParser initialized [2018-04-13 03:40:20,700 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,066 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG06f35ef1a [2018-04-13 03:40:21,231 INFO L287 CDTParser]: IsIndexed: true [2018-04-13 03:40:21,231 INFO L288 CDTParser]: Found 1 translation units. [2018-04-13 03:40:21,232 INFO L168 CDTParser]: Scanning add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,239 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-13 03:40:21,240 INFO L215 ultiparseSymbolTable]: [2018-04-13 03:40:21,240 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-13 03:40:21,240 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i____bswap_64 ('__bswap_64') in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,240 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,240 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i____bswap_32 ('__bswap_32') in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,240 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-13 03:40:21,240 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i____int32_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,240 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i__u_int in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,240 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i__mode_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,240 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i____rlim_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,240 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i__div_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,241 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i__pthread_mutex_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,241 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i__fsblkcnt_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,241 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i__key_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,241 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i____u_short in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,241 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i__size_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,241 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i__lldiv_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,241 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i__uid_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,241 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i__time_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,241 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i__pthread_rwlock_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,241 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i__blksize_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,241 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i____dev_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,241 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i__pthread_key_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,241 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i____intptr_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,241 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i____mode_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,241 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i____caddr_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,241 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i__int32_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,241 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i__fd_set in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,241 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i____uint32_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,241 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i__pid_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,241 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i__fsfilcnt_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,242 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i__gid_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,242 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i__u_short in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,242 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i__caddr_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,242 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i____int8_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,242 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i__ulong in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,242 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i__pthread_barrierattr_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,242 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i__register_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,242 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i__sigset_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,242 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i____fsfilcnt64_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,242 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i__clock_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,242 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i__daddr_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,242 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i____int64_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,243 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i____blksize_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,243 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i__int8_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,243 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i____fsblkcnt_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,243 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i____qaddr_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,243 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i____uint16_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,243 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i____WAIT_STATUS in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,243 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i__ino_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,243 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i__pthread_condattr_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,243 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i____rlim64_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,243 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i____fsfilcnt_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,243 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i__ldiv_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,244 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i__loff_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,244 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i__u_quad_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,244 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i__int64_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,244 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i__ushort in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,244 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i____time_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,244 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i____uint8_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,244 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i__u_int64_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,244 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i__pthread_spinlock_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,244 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i____clock_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,244 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i__fsid_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,244 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i____daddr_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,244 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i____key_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,244 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i__u_int16_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,245 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i____blkcnt_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,245 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i__dev_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,245 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i__fd_mask in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,245 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i__u_int8_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,245 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i____u_int in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,245 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i____useconds_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,245 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i____loff_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,245 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i__suseconds_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,245 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i__pthread_cond_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,245 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i____syscall_slong_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,246 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i__quad_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,246 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i____clockid_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,246 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i__clockid_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,246 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i____fsid_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,246 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i__nlink_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,246 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i__u_long in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,246 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i____off_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,246 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i__ssize_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,246 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i____fsword_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,246 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i__id_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,246 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i__pthread_rwlockattr_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,246 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i__uint in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,247 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i____uid_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,247 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i____ino_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,247 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i____sigset_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,247 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i____ino64_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,247 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i__u_char in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,247 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i__blkcnt_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,247 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i____pthread_list_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,247 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i____u_long in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,247 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i____blkcnt64_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,247 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i____int16_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,247 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i____uint64_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,247 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i__pthread_once_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,247 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i__u_int32_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,247 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i____nlink_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,247 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i__off_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,247 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i____sig_atomic_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,247 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i____socklen_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,247 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i____ssize_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,247 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i__timer_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,247 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i____gid_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,247 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i____u_char in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,248 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i__int16_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,248 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i____syscall_ulong_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,248 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i____fd_mask in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,248 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i__pthread_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,248 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i____timer_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,248 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i__pthread_attr_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,248 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i____u_quad_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,248 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i____id_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,248 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i__wchar_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,248 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i__pthread_barrier_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,248 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i__pthread_mutexattr_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,248 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i____off64_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,248 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i____pid_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,248 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i____suseconds_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,248 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i____quad_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,249 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i____fsblkcnt64_t in add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,263 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG06f35ef1a [2018-04-13 03:40:21,266 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-13 03:40:21,267 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-13 03:40:21,268 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-13 03:40:21,268 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-13 03:40:21,272 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-13 03:40:21,273 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 03:40:21" (1/1) ... [2018-04-13 03:40:21,275 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@687bed61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:40:21, skipping insertion in model container [2018-04-13 03:40:21,275 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 03:40:21" (1/1) ... [2018-04-13 03:40:21,287 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-13 03:40:21,311 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-13 03:40:21,436 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-13 03:40:21,469 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-13 03:40:21,475 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 111 non ball SCCs. Number of states in SCCs 111. [2018-04-13 03:40:21,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:40:21 WrapperNode [2018-04-13 03:40:21,512 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-13 03:40:21,512 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-13 03:40:21,512 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-13 03:40:21,513 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-13 03:40:21,523 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:40:21" (1/1) ... [2018-04-13 03:40:21,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:40:21" (1/1) ... [2018-04-13 03:40:21,535 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:40:21" (1/1) ... [2018-04-13 03:40:21,536 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:40:21" (1/1) ... [2018-04-13 03:40:21,543 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:40:21" (1/1) ... [2018-04-13 03:40:21,547 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:40:21" (1/1) ... [2018-04-13 03:40:21,549 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:40:21" (1/1) ... [2018-04-13 03:40:21,552 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-13 03:40:21,553 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-13 03:40:21,553 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-13 03:40:21,553 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-13 03:40:21,554 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:40:21" (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 03:40:21,651 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-13 03:40:21,651 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-13 03:40:21,651 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-13 03:40:21,651 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-13 03:40:21,651 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-13 03:40:21,651 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-13 03:40:21,652 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fadd_last_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-13 03:40:21,652 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-13 03:40:21,652 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-13 03:40:21,652 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-13 03:40:21,652 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-13 03:40:21,652 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-13 03:40:21,652 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-13 03:40:21,652 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-13 03:40:21,652 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-13 03:40:21,653 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-13 03:40:21,653 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-13 03:40:21,653 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-13 03:40:21,653 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-13 03:40:21,653 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-13 03:40:21,653 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-13 03:40:21,653 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-13 03:40:21,653 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-13 03:40:21,653 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-13 03:40:21,653 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-13 03:40:21,654 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-13 03:40:21,654 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-13 03:40:21,654 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-13 03:40:21,654 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-13 03:40:21,654 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-13 03:40:21,654 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-13 03:40:21,654 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-13 03:40:21,654 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-13 03:40:21,654 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-13 03:40:21,655 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-13 03:40:21,655 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-13 03:40:21,655 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-13 03:40:21,655 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-13 03:40:21,655 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-13 03:40:21,655 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-13 03:40:21,655 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-13 03:40:21,655 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-13 03:40:21,655 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-13 03:40:21,656 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-13 03:40:21,656 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-13 03:40:21,656 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-13 03:40:21,656 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-13 03:40:21,656 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-13 03:40:21,656 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-13 03:40:21,656 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-13 03:40:21,656 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-13 03:40:21,656 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-13 03:40:21,657 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-13 03:40:21,657 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-13 03:40:21,657 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-13 03:40:21,657 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-13 03:40:21,657 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-13 03:40:21,657 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-13 03:40:21,657 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-13 03:40:21,657 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-13 03:40:21,657 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-13 03:40:21,657 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-13 03:40:21,658 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-13 03:40:21,658 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-13 03:40:21,658 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-13 03:40:21,658 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-13 03:40:21,658 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-13 03:40:21,658 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-13 03:40:21,658 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-13 03:40:21,658 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-13 03:40:21,658 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-13 03:40:21,658 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-13 03:40:21,659 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-13 03:40:21,659 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-13 03:40:21,659 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-13 03:40:21,659 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-13 03:40:21,659 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-13 03:40:21,659 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-13 03:40:21,659 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-13 03:40:21,659 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-13 03:40:21,659 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-13 03:40:21,659 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-13 03:40:21,660 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-13 03:40:21,660 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-13 03:40:21,660 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-13 03:40:21,660 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-13 03:40:21,660 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-13 03:40:21,660 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-13 03:40:21,660 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-13 03:40:21,660 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-13 03:40:21,660 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-13 03:40:21,660 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-13 03:40:21,660 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-13 03:40:21,660 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-13 03:40:21,660 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-13 03:40:21,660 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-13 03:40:21,660 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-13 03:40:21,661 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-13 03:40:21,661 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-13 03:40:21,661 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-13 03:40:21,661 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-13 03:40:21,661 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-13 03:40:21,661 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-13 03:40:21,661 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-13 03:40:21,661 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-13 03:40:21,661 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-13 03:40:21,662 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-13 03:40:21,662 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-13 03:40:21,662 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-13 03:40:21,662 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-13 03:40:21,662 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-13 03:40:21,662 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-13 03:40:21,662 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-13 03:40:21,662 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-13 03:40:21,662 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-13 03:40:21,662 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-13 03:40:21,901 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-13 03:40:21,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 03:40:21 BoogieIcfgContainer [2018-04-13 03:40:21,901 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-13 03:40:21,902 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-13 03:40:21,902 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-13 03:40:21,904 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-13 03:40:21,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 03:40:21" (1/3) ... [2018-04-13 03:40:21,905 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b2b1fba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 03:40:21, skipping insertion in model container [2018-04-13 03:40:21,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 03:40:21" (2/3) ... [2018-04-13 03:40:21,905 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b2b1fba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 03:40:21, skipping insertion in model container [2018-04-13 03:40:21,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 03:40:21" (3/3) ... [2018-04-13 03:40:21,907 INFO L107 eAbstractionObserver]: Analyzing ICFG add_last-alloca_true-valid-memsafety_true-termination.i [2018-04-13 03:40:21,913 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-13 03:40:21,921 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2018-04-13 03:40:21,958 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-13 03:40:21,958 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-13 03:40:21,959 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-13 03:40:21,959 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-13 03:40:21,959 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-13 03:40:21,959 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-13 03:40:21,959 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-13 03:40:21,959 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-13 03:40:21,959 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-13 03:40:21,960 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-13 03:40:21,971 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-04-13 03:40:21,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-04-13 03:40:21,978 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:40:21,978 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:40:21,978 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolationMEMORY_LEAK]=== [2018-04-13 03:40:21,981 INFO L82 PathProgramCache]: Analyzing trace with hash 404743958, now seen corresponding path program 1 times [2018-04-13 03:40:21,982 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:40:21,983 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:40:22,017 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:22,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:40:22,017 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:22,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:40:22,054 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:40:22,098 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 03:40:22,100 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:40:22,100 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 03:40:22,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 03:40:22,109 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 03:40:22,110 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-13 03:40:22,111 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 5 states. [2018-04-13 03:40:22,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:40:22,195 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2018-04-13 03:40:22,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 03:40:22,204 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-04-13 03:40:22,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:40:22,221 INFO L225 Difference]: With dead ends: 33 [2018-04-13 03:40:22,221 INFO L226 Difference]: Without dead ends: 30 [2018-04-13 03:40:22,223 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-13 03:40:22,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-04-13 03:40:22,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-04-13 03:40:22,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-04-13 03:40:22,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-04-13 03:40:22,257 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 12 [2018-04-13 03:40:22,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:40:22,257 INFO L459 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-04-13 03:40:22,257 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 03:40:22,257 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2018-04-13 03:40:22,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-04-13 03:40:22,258 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:40:22,258 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:40:22,258 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolationMEMORY_LEAK]=== [2018-04-13 03:40:22,258 INFO L82 PathProgramCache]: Analyzing trace with hash 404743959, now seen corresponding path program 1 times [2018-04-13 03:40:22,258 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:40:22,258 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:40:22,259 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:22,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:40:22,260 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:22,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:40:22,272 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:40:22,326 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 03:40:22,326 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:40:22,326 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-13 03:40:22,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-13 03:40:22,328 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-13 03:40:22,328 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-13 03:40:22,328 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 6 states. [2018-04-13 03:40:22,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:40:22,464 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2018-04-13 03:40:22,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-13 03:40:22,465 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-04-13 03:40:22,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:40:22,466 INFO L225 Difference]: With dead ends: 45 [2018-04-13 03:40:22,466 INFO L226 Difference]: Without dead ends: 45 [2018-04-13 03:40:22,467 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-04-13 03:40:22,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-04-13 03:40:22,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2018-04-13 03:40:22,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-04-13 03:40:22,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2018-04-13 03:40:22,471 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 12 [2018-04-13 03:40:22,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:40:22,471 INFO L459 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2018-04-13 03:40:22,471 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-13 03:40:22,471 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2018-04-13 03:40:22,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-13 03:40:22,471 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:40:22,472 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:40:22,472 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolationMEMORY_LEAK]=== [2018-04-13 03:40:22,472 INFO L82 PathProgramCache]: Analyzing trace with hash -337839192, now seen corresponding path program 1 times [2018-04-13 03:40:22,472 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:40:22,472 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:40:22,473 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:22,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:40:22,473 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:22,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:40:22,485 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:40:22,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 03:40:22,535 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:40:22,535 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 03:40:22,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 03:40:22,536 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 03:40:22,536 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-13 03:40:22,536 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand 5 states. [2018-04-13 03:40:22,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:40:22,583 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2018-04-13 03:40:22,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 03:40:22,584 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-04-13 03:40:22,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:40:22,585 INFO L225 Difference]: With dead ends: 35 [2018-04-13 03:40:22,585 INFO L226 Difference]: Without dead ends: 35 [2018-04-13 03:40:22,585 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-04-13 03:40:22,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-04-13 03:40:22,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-04-13 03:40:22,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-04-13 03:40:22,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2018-04-13 03:40:22,588 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 13 [2018-04-13 03:40:22,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:40:22,589 INFO L459 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2018-04-13 03:40:22,589 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 03:40:22,589 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-04-13 03:40:22,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-13 03:40:22,589 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:40:22,589 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:40:22,589 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolationMEMORY_LEAK]=== [2018-04-13 03:40:22,589 INFO L82 PathProgramCache]: Analyzing trace with hash -337934525, now seen corresponding path program 1 times [2018-04-13 03:40:22,590 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:40:22,590 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:40:22,591 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:22,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:40:22,591 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:22,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:40:22,597 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:40:22,616 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 03:40:22,616 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:40:22,617 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 03:40:22,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 03:40:22,617 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 03:40:22,617 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 03:40:22,617 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 4 states. [2018-04-13 03:40:22,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:40:22,632 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2018-04-13 03:40:22,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 03:40:22,632 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-04-13 03:40:22,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:40:22,632 INFO L225 Difference]: With dead ends: 33 [2018-04-13 03:40:22,633 INFO L226 Difference]: Without dead ends: 33 [2018-04-13 03:40:22,633 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 03:40:22,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-04-13 03:40:22,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-04-13 03:40:22,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-04-13 03:40:22,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-04-13 03:40:22,635 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 13 [2018-04-13 03:40:22,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:40:22,635 INFO L459 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2018-04-13 03:40:22,636 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 03:40:22,636 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2018-04-13 03:40:22,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-13 03:40:22,636 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:40:22,636 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:40:22,636 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolationMEMORY_LEAK]=== [2018-04-13 03:40:22,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1960453059, now seen corresponding path program 1 times [2018-04-13 03:40:22,637 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:40:22,637 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:40:22,638 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:22,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:40:22,638 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:22,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:40:22,657 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:40:22,661 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 03:40:22,661 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:40:22,661 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:40:22,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:40:22,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:40:22,688 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:40:22,715 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc3.base| Int)) (and (= 0 (select |c_old(#valid)| |main_#t~malloc3.base|)) (= |c_#valid| (store |c_old(#valid)| |main_#t~malloc3.base| 0)))) is different from true [2018-04-13 03:40:22,718 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 03:40:22,718 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:40:22,718 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 03:40:22,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 03:40:22,719 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 03:40:22,719 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2018-04-13 03:40:22,719 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 5 states. [2018-04-13 03:40:22,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:40:22,746 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-04-13 03:40:22,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 03:40:22,746 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-04-13 03:40:22,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:40:22,747 INFO L225 Difference]: With dead ends: 32 [2018-04-13 03:40:22,747 INFO L226 Difference]: Without dead ends: 28 [2018-04-13 03:40:22,747 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=12, Unknown=2, NotChecked=6, Total=30 [2018-04-13 03:40:22,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-04-13 03:40:22,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-04-13 03:40:22,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-04-13 03:40:22,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-04-13 03:40:22,749 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 18 [2018-04-13 03:40:22,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:40:22,749 INFO L459 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-04-13 03:40:22,749 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 03:40:22,749 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-04-13 03:40:22,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-13 03:40:22,750 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:40:22,750 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:40:22,750 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolationMEMORY_LEAK]=== [2018-04-13 03:40:22,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1407319482, now seen corresponding path program 1 times [2018-04-13 03:40:22,750 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:40:22,750 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:40:22,751 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:22,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:40:22,751 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:22,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:40:22,761 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:40:22,915 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 03:40:22,915 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 03:40:22,915 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-13 03:40:22,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-13 03:40:22,916 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-13 03:40:22,916 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-04-13 03:40:22,916 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 8 states. [2018-04-13 03:40:23,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:40:23,031 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-04-13 03:40:23,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-13 03:40:23,032 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-04-13 03:40:23,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:40:23,032 INFO L225 Difference]: With dead ends: 35 [2018-04-13 03:40:23,032 INFO L226 Difference]: Without dead ends: 28 [2018-04-13 03:40:23,033 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-04-13 03:40:23,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-04-13 03:40:23,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-04-13 03:40:23,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-04-13 03:40:23,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-04-13 03:40:23,035 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 20 [2018-04-13 03:40:23,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:40:23,035 INFO L459 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-04-13 03:40:23,035 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-13 03:40:23,035 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-04-13 03:40:23,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-13 03:40:23,036 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:40:23,036 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:40:23,036 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolationMEMORY_LEAK]=== [2018-04-13 03:40:23,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1876530564, now seen corresponding path program 1 times [2018-04-13 03:40:23,036 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:40:23,037 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:40:23,037 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:23,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:40:23,037 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:23,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:40:23,051 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:40:23,217 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:40:23,217 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:40:23,217 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:40:23,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:40:23,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:40:23,243 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:40:23,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 03:40:23,255 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:23,258 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:23,258 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-13 03:40:23,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-04-13 03:40:23,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-04-13 03:40:23,315 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:40:23,318 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:40:23,328 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-13 03:40:23,328 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:75 [2018-04-13 03:40:23,417 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:40:23,417 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 03:40:23,417 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2018-04-13 03:40:23,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-13 03:40:23,418 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-13 03:40:23,418 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-04-13 03:40:23,418 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 17 states. [2018-04-13 03:40:23,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:40:23,685 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-04-13 03:40:23,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-13 03:40:23,685 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 20 [2018-04-13 03:40:23,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:40:23,686 INFO L225 Difference]: With dead ends: 37 [2018-04-13 03:40:23,686 INFO L226 Difference]: Without dead ends: 37 [2018-04-13 03:40:23,686 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2018-04-13 03:40:23,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-04-13 03:40:23,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-04-13 03:40:23,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-04-13 03:40:23,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-04-13 03:40:23,688 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 20 [2018-04-13 03:40:23,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:40:23,689 INFO L459 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-04-13 03:40:23,689 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-13 03:40:23,689 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-04-13 03:40:23,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-13 03:40:23,689 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:40:23,689 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:40:23,689 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolationMEMORY_LEAK]=== [2018-04-13 03:40:23,690 INFO L82 PathProgramCache]: Analyzing trace with hash -546507853, now seen corresponding path program 2 times [2018-04-13 03:40:23,690 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:40:23,690 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:40:23,690 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:23,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:40:23,691 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:23,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:40:23,704 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:40:24,065 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:40:24,065 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:40:24,065 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:40:24,066 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 03:40:24,091 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 03:40:24,091 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:40:24,094 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:40:24,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 03:40:24,097 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:24,101 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:24,101 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-13 03:40:24,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:40:24,178 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 24 treesize of output 32 [2018-04-13 03:40:24,178 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:24,182 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:24,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:24,189 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:26 [2018-04-13 03:40:24,280 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 03:40:24,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 03:40:24,287 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:40:24,289 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:40:24,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 03:40:24,295 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:48 [2018-04-13 03:40:24,490 WARN L148 SmtUtils]: Spent 181ms on a formula simplification that was a NOOP. DAG size: 25 [2018-04-13 03:40:24,542 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:40:24,543 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 03:40:24,543 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 19 [2018-04-13 03:40:24,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-13 03:40:24,544 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-13 03:40:24,544 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2018-04-13 03:40:24,544 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 20 states. [2018-04-13 03:40:24,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:40:24,930 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-04-13 03:40:24,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-13 03:40:24,931 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 28 [2018-04-13 03:40:24,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:40:24,931 INFO L225 Difference]: With dead ends: 45 [2018-04-13 03:40:24,931 INFO L226 Difference]: Without dead ends: 45 [2018-04-13 03:40:24,931 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 17 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=165, Invalid=765, Unknown=0, NotChecked=0, Total=930 [2018-04-13 03:40:24,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-04-13 03:40:24,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-04-13 03:40:24,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-04-13 03:40:24,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-04-13 03:40:24,934 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 28 [2018-04-13 03:40:24,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:40:24,934 INFO L459 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-04-13 03:40:24,934 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-13 03:40:24,934 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-04-13 03:40:24,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-13 03:40:24,934 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:40:24,934 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:40:24,934 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolationMEMORY_LEAK]=== [2018-04-13 03:40:24,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1699918562, now seen corresponding path program 3 times [2018-04-13 03:40:24,934 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:40:24,935 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:40:24,935 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:24,935 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:40:24,935 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:24,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:40:24,949 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:40:25,353 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:40:25,353 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:40:25,353 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:40:25,354 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 03:40:25,386 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-13 03:40:25,386 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:40:25,389 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:40:25,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 03:40:25,400 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:25,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:25,404 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-13 03:40:25,442 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 03:40:25,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 10 treesize of output 9 [2018-04-13 03:40:25,445 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:25,447 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:25,456 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:25,456 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:40:25,499 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 03:40:25,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 03:40:25,504 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:40:25,506 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:40:25,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 03:40:25,511 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:34 [2018-04-13 03:40:25,584 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:40:25,585 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 03:40:25,585 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2018-04-13 03:40:25,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-13 03:40:25,585 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-13 03:40:25,586 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2018-04-13 03:40:25,586 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 19 states. [2018-04-13 03:40:25,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:40:25,891 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-04-13 03:40:25,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-13 03:40:25,891 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2018-04-13 03:40:25,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:40:25,892 INFO L225 Difference]: With dead ends: 53 [2018-04-13 03:40:25,892 INFO L226 Difference]: Without dead ends: 53 [2018-04-13 03:40:25,892 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=139, Invalid=617, Unknown=0, NotChecked=0, Total=756 [2018-04-13 03:40:25,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-04-13 03:40:25,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2018-04-13 03:40:25,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-04-13 03:40:25,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-04-13 03:40:25,894 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 36 [2018-04-13 03:40:25,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:40:25,894 INFO L459 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-04-13 03:40:25,894 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-13 03:40:25,895 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-04-13 03:40:25,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-13 03:40:25,895 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:40:25,895 INFO L355 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:40:25,895 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolationMEMORY_LEAK]=== [2018-04-13 03:40:25,895 INFO L82 PathProgramCache]: Analyzing trace with hash 2107233041, now seen corresponding path program 4 times [2018-04-13 03:40:25,895 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:40:25,895 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:40:25,896 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:25,896 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:40:25,896 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:25,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:40:25,909 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:40:26,236 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:40:26,236 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:40:26,236 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:40:26,237 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 03:40:26,269 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 03:40:26,269 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:40:26,272 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:40:26,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 03:40:26,281 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:26,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:26,284 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-13 03:40:26,352 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 03:40:26,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 03:40:26,366 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:40:26,369 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:40:26,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 03:40:26,374 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:48 [2018-04-13 03:40:26,467 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:40:26,468 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 03:40:26,468 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 19 [2018-04-13 03:40:26,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-13 03:40:26,468 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-13 03:40:26,468 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2018-04-13 03:40:26,468 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 20 states. [2018-04-13 03:40:26,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:40:26,836 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-04-13 03:40:26,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-13 03:40:26,837 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 44 [2018-04-13 03:40:26,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:40:26,837 INFO L225 Difference]: With dead ends: 61 [2018-04-13 03:40:26,837 INFO L226 Difference]: Without dead ends: 61 [2018-04-13 03:40:26,838 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 33 SyntacticMatches, 6 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=139, Invalid=673, Unknown=0, NotChecked=0, Total=812 [2018-04-13 03:40:26,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-04-13 03:40:26,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2018-04-13 03:40:26,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-04-13 03:40:26,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-04-13 03:40:26,841 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 44 [2018-04-13 03:40:26,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:40:26,842 INFO L459 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-04-13 03:40:26,842 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-13 03:40:26,842 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-04-13 03:40:26,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-13 03:40:26,843 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:40:26,843 INFO L355 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:40:26,843 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolationMEMORY_LEAK]=== [2018-04-13 03:40:26,843 INFO L82 PathProgramCache]: Analyzing trace with hash 626086976, now seen corresponding path program 5 times [2018-04-13 03:40:26,844 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:40:26,844 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:40:26,844 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:26,844 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:40:26,845 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:26,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:40:26,858 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:40:27,350 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:40:27,350 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:40:27,350 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:40:27,351 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 03:40:27,423 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-04-13 03:40:27,423 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:40:27,429 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:40:27,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 03:40:27,432 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:27,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:27,437 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-13 03:40:27,526 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 03:40:27,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:40:27,529 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:27,534 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:27,541 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:27,541 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:40:27,587 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 03:40:27,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 03:40:27,602 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:40:27,605 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:40:27,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 03:40:27,611 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:34 [2018-04-13 03:40:27,735 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:40:27,735 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 03:40:27,735 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 22 [2018-04-13 03:40:27,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-13 03:40:27,736 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-13 03:40:27,736 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2018-04-13 03:40:27,736 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 23 states. [2018-04-13 03:40:28,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:40:28,215 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-04-13 03:40:28,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-13 03:40:28,215 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 52 [2018-04-13 03:40:28,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:40:28,216 INFO L225 Difference]: With dead ends: 69 [2018-04-13 03:40:28,216 INFO L226 Difference]: Without dead ends: 69 [2018-04-13 03:40:28,216 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=185, Invalid=1075, Unknown=0, NotChecked=0, Total=1260 [2018-04-13 03:40:28,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-04-13 03:40:28,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2018-04-13 03:40:28,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-04-13 03:40:28,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-04-13 03:40:28,218 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 52 [2018-04-13 03:40:28,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:40:28,218 INFO L459 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-04-13 03:40:28,218 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-13 03:40:28,218 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-04-13 03:40:28,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-13 03:40:28,219 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:40:28,219 INFO L355 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:40:28,219 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolationMEMORY_LEAK]=== [2018-04-13 03:40:28,219 INFO L82 PathProgramCache]: Analyzing trace with hash -628607377, now seen corresponding path program 6 times [2018-04-13 03:40:28,219 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:40:28,219 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:40:28,219 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:28,219 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:40:28,220 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:28,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:40:28,233 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:40:28,828 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:40:28,829 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:40:28,829 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:40:28,829 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 03:40:28,855 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-04-13 03:40:28,855 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:40:28,897 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:40:28,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 03:40:28,899 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:28,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:28,902 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-13 03:40:29,080 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 03:40:29,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 03:40:29,085 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:40:29,092 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:40:29,099 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 03:40:29,099 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:48 [2018-04-13 03:40:29,200 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:40:29,201 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 03:40:29,201 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 24 [2018-04-13 03:40:29,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-13 03:40:29,201 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-13 03:40:29,202 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2018-04-13 03:40:29,202 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 25 states. [2018-04-13 03:40:29,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:40:29,891 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-04-13 03:40:29,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-13 03:40:29,892 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 60 [2018-04-13 03:40:29,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:40:29,892 INFO L225 Difference]: With dead ends: 77 [2018-04-13 03:40:29,892 INFO L226 Difference]: Without dead ends: 77 [2018-04-13 03:40:29,893 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=204, Invalid=1278, Unknown=0, NotChecked=0, Total=1482 [2018-04-13 03:40:29,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-04-13 03:40:29,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2018-04-13 03:40:29,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-04-13 03:40:29,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-04-13 03:40:29,895 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 60 [2018-04-13 03:40:29,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:40:29,896 INFO L459 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-04-13 03:40:29,896 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-13 03:40:29,896 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-04-13 03:40:29,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-04-13 03:40:29,896 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:40:29,896 INFO L355 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:40:29,897 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolationMEMORY_LEAK]=== [2018-04-13 03:40:29,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1672644194, now seen corresponding path program 7 times [2018-04-13 03:40:29,897 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:40:29,897 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:40:29,898 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:29,898 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:40:29,898 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:29,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:40:29,912 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:40:30,417 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:40:30,418 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:40:30,418 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:40:30,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:40:30,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:40:30,470 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:40:30,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, 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 03:40:30,488 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:30,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:30,491 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-13 03:40:30,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:40:30,638 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 24 treesize of output 32 [2018-04-13 03:40:30,638 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:30,643 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:30,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:30,651 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:26 [2018-04-13 03:40:30,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 03:40:30,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:40:30,725 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:30,727 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:30,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:30,735 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:25 [2018-04-13 03:40:30,776 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 03:40:30,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:40:30,781 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:30,783 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:30,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:30,792 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:25 [2018-04-13 03:40:30,824 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 03:40:30,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 03:40:30,827 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:30,828 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:30,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:30,836 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:25 [2018-04-13 03:40:30,921 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 03:40:30,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 03:40:30,929 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:40:30,932 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:40:30,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 03:40:30,941 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:48 [2018-04-13 03:40:31,046 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:40:31,046 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 03:40:31,047 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 29 [2018-04-13 03:40:31,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-13 03:40:31,047 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-13 03:40:31,047 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=763, Unknown=0, NotChecked=0, Total=870 [2018-04-13 03:40:31,048 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 30 states. [2018-04-13 03:40:31,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:40:31,792 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-04-13 03:40:31,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-13 03:40:31,792 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 68 [2018-04-13 03:40:31,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:40:31,793 INFO L225 Difference]: With dead ends: 85 [2018-04-13 03:40:31,793 INFO L226 Difference]: Without dead ends: 85 [2018-04-13 03:40:31,794 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 51 SyntacticMatches, 5 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=280, Invalid=2072, Unknown=0, NotChecked=0, Total=2352 [2018-04-13 03:40:31,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-04-13 03:40:31,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2018-04-13 03:40:31,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-04-13 03:40:31,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-04-13 03:40:31,796 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 68 [2018-04-13 03:40:31,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:40:31,796 INFO L459 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-04-13 03:40:31,796 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-13 03:40:31,796 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-04-13 03:40:31,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-04-13 03:40:31,797 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:40:31,797 INFO L355 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:40:31,797 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolationMEMORY_LEAK]=== [2018-04-13 03:40:31,797 INFO L82 PathProgramCache]: Analyzing trace with hash -357556787, now seen corresponding path program 8 times [2018-04-13 03:40:31,797 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:40:31,797 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:40:31,798 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:31,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:40:31,798 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:31,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:40:31,807 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:40:32,337 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:40:32,337 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:40:32,337 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:40:32,338 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 03:40:32,393 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 03:40:32,393 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:40:32,398 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:40:32,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 03:40:32,409 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:32,413 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:32,413 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-13 03:40:32,653 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 03:40:32,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 03:40:32,662 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:40:32,665 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:40:32,673 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 03:40:32,673 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:48 [2018-04-13 03:40:32,819 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:40:32,819 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 03:40:32,819 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 27 [2018-04-13 03:40:32,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-13 03:40:32,820 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-13 03:40:32,820 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=664, Unknown=0, NotChecked=0, Total=756 [2018-04-13 03:40:32,821 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 28 states. [2018-04-13 03:40:33,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:40:33,311 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-04-13 03:40:33,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-13 03:40:33,312 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 76 [2018-04-13 03:40:33,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:40:33,312 INFO L225 Difference]: With dead ends: 93 [2018-04-13 03:40:33,312 INFO L226 Difference]: Without dead ends: 93 [2018-04-13 03:40:33,312 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 61 SyntacticMatches, 6 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=195, Invalid=1445, Unknown=0, NotChecked=0, Total=1640 [2018-04-13 03:40:33,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-04-13 03:40:33,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2018-04-13 03:40:33,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-04-13 03:40:33,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-04-13 03:40:33,314 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 76 [2018-04-13 03:40:33,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:40:33,315 INFO L459 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-04-13 03:40:33,315 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-13 03:40:33,315 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-04-13 03:40:33,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-04-13 03:40:33,315 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:40:33,315 INFO L355 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:40:33,315 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolationMEMORY_LEAK]=== [2018-04-13 03:40:33,316 INFO L82 PathProgramCache]: Analyzing trace with hash -960552196, now seen corresponding path program 9 times [2018-04-13 03:40:33,316 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:40:33,316 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:40:33,316 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:33,316 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:40:33,316 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:33,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:40:33,326 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:40:33,841 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:40:33,842 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:40:33,842 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:40:33,842 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 03:40:33,892 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-04-13 03:40:33,892 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:40:33,897 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:40:33,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 8 treesize of output 7 [2018-04-13 03:40:33,929 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:33,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:33,931 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-13 03:40:34,038 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 03:40:34,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:40:34,040 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:34,041 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:34,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:34,047 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:40:34,069 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 03:40:34,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:40:34,071 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:34,072 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:34,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:34,078 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:40:34,103 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 03:40:34,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:40:34,105 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:34,106 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:34,111 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:34,112 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:40:34,156 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 03:40:34,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 03:40:34,161 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:40:34,164 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:40:34,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 03:40:34,169 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:34 [2018-04-13 03:40:34,288 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:40:34,289 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 03:40:34,289 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 30 [2018-04-13 03:40:34,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-13 03:40:34,290 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-13 03:40:34,290 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=830, Unknown=0, NotChecked=0, Total=930 [2018-04-13 03:40:34,290 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 31 states. [2018-04-13 03:40:35,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:40:35,088 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-04-13 03:40:35,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-13 03:40:35,089 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 84 [2018-04-13 03:40:35,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:40:35,089 INFO L225 Difference]: With dead ends: 101 [2018-04-13 03:40:35,089 INFO L226 Difference]: Without dead ends: 101 [2018-04-13 03:40:35,090 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 69 SyntacticMatches, 4 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=277, Invalid=2375, Unknown=0, NotChecked=0, Total=2652 [2018-04-13 03:40:35,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-04-13 03:40:35,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2018-04-13 03:40:35,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-04-13 03:40:35,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-04-13 03:40:35,093 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 84 [2018-04-13 03:40:35,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:40:35,093 INFO L459 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-04-13 03:40:35,093 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-13 03:40:35,093 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-04-13 03:40:35,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-04-13 03:40:35,094 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:40:35,094 INFO L355 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:40:35,094 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolationMEMORY_LEAK]=== [2018-04-13 03:40:35,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1299609301, now seen corresponding path program 10 times [2018-04-13 03:40:35,095 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:40:35,095 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:40:35,095 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:35,095 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:40:35,095 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:35,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:40:35,111 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:40:35,710 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:40:35,710 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:40:35,710 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:40:35,711 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 03:40:35,748 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 03:40:35,748 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:40:35,751 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:40:35,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 03:40:35,764 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:35,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:35,767 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-13 03:40:36,065 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 03:40:36,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 03:40:36,073 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:40:36,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:40:36,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 03:40:36,086 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:48 [2018-04-13 03:40:36,235 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:40:36,236 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 03:40:36,236 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 32 [2018-04-13 03:40:36,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-13 03:40:36,236 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-13 03:40:36,237 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=945, Unknown=0, NotChecked=0, Total=1056 [2018-04-13 03:40:36,237 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 33 states. [2018-04-13 03:40:37,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:40:37,219 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-04-13 03:40:37,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-13 03:40:37,220 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 92 [2018-04-13 03:40:37,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:40:37,220 INFO L225 Difference]: With dead ends: 109 [2018-04-13 03:40:37,220 INFO L226 Difference]: Without dead ends: 109 [2018-04-13 03:40:37,221 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 75 SyntacticMatches, 6 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=296, Invalid=2674, Unknown=0, NotChecked=0, Total=2970 [2018-04-13 03:40:37,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-04-13 03:40:37,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2018-04-13 03:40:37,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-04-13 03:40:37,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-04-13 03:40:37,224 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 92 [2018-04-13 03:40:37,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:40:37,224 INFO L459 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-04-13 03:40:37,224 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-13 03:40:37,224 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-04-13 03:40:37,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-04-13 03:40:37,225 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:40:37,225 INFO L355 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:40:37,225 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolationMEMORY_LEAK]=== [2018-04-13 03:40:37,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1323413414, now seen corresponding path program 11 times [2018-04-13 03:40:37,226 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:40:37,226 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:40:37,226 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:37,226 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:40:37,227 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:37,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:40:37,246 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:40:37,884 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:40:37,885 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:40:37,885 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:40:37,885 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 03:40:37,992 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-04-13 03:40:37,993 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:40:37,998 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:40:38,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 03:40:38,012 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:38,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:38,018 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-13 03:40:38,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-04-13 03:40:38,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-04-13 03:40:38,557 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:40:38,560 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:40:38,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 03:40:38,567 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:57 [2018-04-13 03:40:38,711 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:40:38,711 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 03:40:38,711 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 38 [2018-04-13 03:40:38,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-13 03:40:38,712 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-13 03:40:38,712 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1332, Unknown=0, NotChecked=0, Total=1482 [2018-04-13 03:40:38,712 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 39 states. [2018-04-13 03:40:40,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:40:40,132 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-04-13 03:40:40,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-13 03:40:40,132 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 100 [2018-04-13 03:40:40,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:40:40,133 INFO L225 Difference]: With dead ends: 117 [2018-04-13 03:40:40,133 INFO L226 Difference]: Without dead ends: 117 [2018-04-13 03:40:40,134 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1028 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=412, Invalid=3620, Unknown=0, NotChecked=0, Total=4032 [2018-04-13 03:40:40,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-04-13 03:40:40,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2018-04-13 03:40:40,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-04-13 03:40:40,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2018-04-13 03:40:40,136 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 100 [2018-04-13 03:40:40,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:40:40,136 INFO L459 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2018-04-13 03:40:40,136 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-13 03:40:40,136 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2018-04-13 03:40:40,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-04-13 03:40:40,137 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:40:40,137 INFO L355 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:40:40,137 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolationMEMORY_LEAK]=== [2018-04-13 03:40:40,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1183611017, now seen corresponding path program 12 times [2018-04-13 03:40:40,137 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:40:40,137 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:40:40,138 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:40,138 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:40:40,138 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:40,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:40:40,149 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:40:40,927 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:40:40,927 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:40:40,927 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:40:40,928 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 03:40:41,013 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-04-13 03:40:41,013 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:40:41,017 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:40:41,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:40:41,022 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:41,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:41,025 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-13 03:40:41,477 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 03:40:41,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 03:40:41,482 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:40:41,484 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:40:41,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 03:40:41,490 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:48 [2018-04-13 03:40:41,680 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:40:41,680 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 03:40:41,681 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 36 [2018-04-13 03:40:41,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-13 03:40:41,681 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-13 03:40:41,682 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1207, Unknown=0, NotChecked=0, Total=1332 [2018-04-13 03:40:41,682 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 37 states. [2018-04-13 03:40:42,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:40:42,854 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2018-04-13 03:40:42,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-13 03:40:42,854 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 108 [2018-04-13 03:40:42,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:40:42,855 INFO L225 Difference]: With dead ends: 125 [2018-04-13 03:40:42,855 INFO L226 Difference]: Without dead ends: 125 [2018-04-13 03:40:42,855 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 91 SyntacticMatches, 4 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 929 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=324, Invalid=3336, Unknown=0, NotChecked=0, Total=3660 [2018-04-13 03:40:42,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-04-13 03:40:42,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2018-04-13 03:40:42,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-04-13 03:40:42,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2018-04-13 03:40:42,858 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 108 [2018-04-13 03:40:42,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:40:42,858 INFO L459 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2018-04-13 03:40:42,858 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-13 03:40:42,858 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2018-04-13 03:40:42,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-04-13 03:40:42,859 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:40:42,859 INFO L355 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:40:42,859 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolationMEMORY_LEAK]=== [2018-04-13 03:40:42,859 INFO L82 PathProgramCache]: Analyzing trace with hash 2011365816, now seen corresponding path program 13 times [2018-04-13 03:40:42,860 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:40:42,860 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:40:42,860 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:42,860 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:40:42,860 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:42,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:40:42,891 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:40:43,550 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:40:43,550 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:40:43,550 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:40:43,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:40:43,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:40:43,663 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:40:43,665 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:40:43,666 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:43,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:43,669 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-13 03:40:43,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:40:43,856 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 24 treesize of output 32 [2018-04-13 03:40:43,857 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:43,861 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:43,872 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:43,872 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:26 [2018-04-13 03:40:44,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:40:44,116 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 24 treesize of output 32 [2018-04-13 03:40:44,116 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:44,123 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:44,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:44,151 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:34 [2018-04-13 03:40:44,248 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 03:40:44,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 03:40:44,251 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:44,253 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:44,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:44,266 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:33 [2018-04-13 03:40:44,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:40:44,458 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 24 treesize of output 32 [2018-04-13 03:40:44,459 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:44,464 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:44,476 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:44,476 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:42 [2018-04-13 03:40:44,684 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:40:44,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2018-04-13 03:40:44,688 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:44,692 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:44,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:44,702 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:71, output treesize:50 [2018-04-13 03:40:44,785 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 03:40:44,786 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:40:44,786 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:44,788 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:44,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:44,799 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:62, output treesize:49 [2018-04-13 03:40:44,838 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 03:40:44,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:40:44,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:44,841 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:44,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:44,851 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:62, output treesize:49 [2018-04-13 03:40:44,891 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 03:40:44,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:40:44,892 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:44,894 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:44,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:44,903 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:62, output treesize:49 [2018-04-13 03:40:45,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:40:45,086 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 24 treesize of output 32 [2018-04-13 03:40:45,086 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:45,090 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:45,101 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:45,101 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:79, output treesize:58 [2018-04-13 03:40:45,196 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 03:40:45,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:40:45,198 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:45,202 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:45,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:45,213 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:70, output treesize:57 [2018-04-13 03:40:45,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:40:45,414 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 24 treesize of output 32 [2018-04-13 03:40:45,414 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:45,417 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:45,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:45,429 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:87, output treesize:66 [2018-04-13 03:40:45,582 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 03:40:45,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 03:40:45,594 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:40:45,596 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:40:45,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 03:40:45,601 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:48 [2018-04-13 03:40:45,795 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:40:45,795 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 03:40:45,795 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 44] total 61 [2018-04-13 03:40:45,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-04-13 03:40:45,796 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-04-13 03:40:45,796 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=3523, Unknown=0, NotChecked=0, Total=3782 [2018-04-13 03:40:45,796 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 62 states. [2018-04-13 03:40:48,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:40:48,275 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2018-04-13 03:40:48,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-04-13 03:40:48,275 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 116 [2018-04-13 03:40:48,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:40:48,276 INFO L225 Difference]: With dead ends: 133 [2018-04-13 03:40:48,276 INFO L226 Difference]: Without dead ends: 133 [2018-04-13 03:40:48,278 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 73 SyntacticMatches, 5 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3657 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=700, Invalid=10430, Unknown=0, NotChecked=0, Total=11130 [2018-04-13 03:40:48,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-04-13 03:40:48,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2018-04-13 03:40:48,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-04-13 03:40:48,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2018-04-13 03:40:48,281 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 116 [2018-04-13 03:40:48,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:40:48,281 INFO L459 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2018-04-13 03:40:48,281 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-04-13 03:40:48,282 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2018-04-13 03:40:48,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-04-13 03:40:48,287 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:40:48,287 INFO L355 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:40:48,287 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolationMEMORY_LEAK]=== [2018-04-13 03:40:48,287 INFO L82 PathProgramCache]: Analyzing trace with hash -885986329, now seen corresponding path program 14 times [2018-04-13 03:40:48,287 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:40:48,287 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:40:48,288 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:48,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:40:48,288 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:48,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:40:48,307 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:40:49,150 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:40:49,151 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:40:49,151 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:40:49,151 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 03:40:49,252 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 03:40:49,252 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:40:49,256 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:40:49,259 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:40:49,260 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:49,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:49,262 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-13 03:40:49,826 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 03:40:49,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 03:40:49,834 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:40:49,838 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:40:49,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 03:40:49,847 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:48 [2018-04-13 03:40:50,039 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:40:50,039 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 03:40:50,039 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 40 [2018-04-13 03:40:50,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-13 03:40:50,040 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-13 03:40:50,040 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1501, Unknown=0, NotChecked=0, Total=1640 [2018-04-13 03:40:50,040 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 41 states. [2018-04-13 03:40:51,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:40:51,561 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-04-13 03:40:51,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-13 03:40:51,561 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 124 [2018-04-13 03:40:51,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:40:51,562 INFO L225 Difference]: With dead ends: 141 [2018-04-13 03:40:51,562 INFO L226 Difference]: Without dead ends: 141 [2018-04-13 03:40:51,563 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 104 SyntacticMatches, 5 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1310 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=388, Invalid=4582, Unknown=0, NotChecked=0, Total=4970 [2018-04-13 03:40:51,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-04-13 03:40:51,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 140. [2018-04-13 03:40:51,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-04-13 03:40:51,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 140 transitions. [2018-04-13 03:40:51,564 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 140 transitions. Word has length 124 [2018-04-13 03:40:51,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:40:51,565 INFO L459 AbstractCegarLoop]: Abstraction has 140 states and 140 transitions. [2018-04-13 03:40:51,565 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-13 03:40:51,565 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 140 transitions. [2018-04-13 03:40:51,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-04-13 03:40:51,565 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:40:51,565 INFO L355 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:40:51,565 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolationMEMORY_LEAK]=== [2018-04-13 03:40:51,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1199912726, now seen corresponding path program 15 times [2018-04-13 03:40:51,565 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:40:51,566 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:40:51,566 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:51,566 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:40:51,566 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:51,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:40:51,580 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:40:52,326 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:40:52,326 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:40:52,326 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:40:52,326 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 03:40:52,376 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-04-13 03:40:52,376 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:40:52,383 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:40:52,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 03:40:52,386 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:52,389 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:52,389 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-13 03:40:52,710 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 03:40:52,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 03:40:52,715 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:40:52,717 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:40:52,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 03:40:52,723 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:34 [2018-04-13 03:40:52,892 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:40:52,892 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 03:40:52,892 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 42 [2018-04-13 03:40:52,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-04-13 03:40:52,893 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-04-13 03:40:52,893 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1664, Unknown=0, NotChecked=0, Total=1806 [2018-04-13 03:40:52,894 INFO L87 Difference]: Start difference. First operand 140 states and 140 transitions. Second operand 43 states. [2018-04-13 03:40:54,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:40:54,716 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2018-04-13 03:40:54,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-13 03:40:54,716 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 132 [2018-04-13 03:40:54,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:40:54,716 INFO L225 Difference]: With dead ends: 149 [2018-04-13 03:40:54,717 INFO L226 Difference]: Without dead ends: 149 [2018-04-13 03:40:54,718 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 111 SyntacticMatches, 4 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1497 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=415, Invalid=5285, Unknown=0, NotChecked=0, Total=5700 [2018-04-13 03:40:54,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-04-13 03:40:54,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 148. [2018-04-13 03:40:54,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-04-13 03:40:54,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2018-04-13 03:40:54,720 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 132 [2018-04-13 03:40:54,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:40:54,720 INFO L459 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2018-04-13 03:40:54,720 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-04-13 03:40:54,720 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2018-04-13 03:40:54,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-04-13 03:40:54,721 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:40:54,721 INFO L355 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:40:54,721 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolationMEMORY_LEAK]=== [2018-04-13 03:40:54,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1961812805, now seen corresponding path program 16 times [2018-04-13 03:40:54,721 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:40:54,721 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:40:54,722 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:54,722 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:40:54,722 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:54,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:40:54,736 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:40:55,493 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:40:55,494 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:40:55,494 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:40:55,494 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 03:40:55,564 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 03:40:55,564 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:40:55,572 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:40:55,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 03:40:55,586 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:55,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:55,589 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-13 03:40:55,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:40:55,728 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 24 treesize of output 32 [2018-04-13 03:40:55,729 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:55,732 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:55,739 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:55,739 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:26 [2018-04-13 03:40:55,790 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 03:40:55,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:40:55,791 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:55,793 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:55,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:55,799 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:25 [2018-04-13 03:40:55,826 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 03:40:55,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:40:55,827 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:55,829 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:55,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:55,834 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:25 [2018-04-13 03:40:55,861 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 03:40:55,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:40:55,862 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:55,863 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:55,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:55,868 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:25 [2018-04-13 03:40:55,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-13 03:40:55,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:40:55,894 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:55,895 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:55,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:55,900 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:25 [2018-04-13 03:40:55,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 03:40:55,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:40:55,926 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:55,927 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:55,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:55,933 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:25 [2018-04-13 03:40:55,960 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 03:40:55,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:40:55,962 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:55,963 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:55,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:55,969 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:25 [2018-04-13 03:40:56,004 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 03:40:56,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:40:56,006 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:56,007 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:56,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:56,013 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:25 [2018-04-13 03:40:56,039 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 03:40:56,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:40:56,040 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:56,041 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:56,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:56,047 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:25 [2018-04-13 03:40:56,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-13 03:40:56,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:40:56,077 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:56,078 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:56,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:56,083 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:25 [2018-04-13 03:40:56,112 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 03:40:56,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:40:56,113 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:56,114 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:56,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:56,120 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:25 [2018-04-13 03:40:56,149 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 03:40:56,150 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:40:56,151 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:56,152 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:56,157 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:56,157 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:25 [2018-04-13 03:40:56,189 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 03:40:56,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:40:56,190 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:56,191 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:56,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:56,197 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:25 [2018-04-13 03:40:56,227 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 03:40:56,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:40:56,229 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:56,230 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:56,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:56,236 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:25 [2018-04-13 03:40:56,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, 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 03:40:56,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:40:56,273 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:56,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:56,280 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:56,280 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:25 [2018-04-13 03:40:56,350 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 03:40:56,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 03:40:56,363 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:40:56,364 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:40:56,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 03:40:56,369 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:48 [2018-04-13 03:40:56,506 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:40:56,506 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 03:40:56,506 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 27] total 47 [2018-04-13 03:40:56,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-04-13 03:40:56,507 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-04-13 03:40:56,507 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=2090, Unknown=0, NotChecked=0, Total=2256 [2018-04-13 03:40:56,507 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 48 states. [2018-04-13 03:40:58,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:40:58,099 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2018-04-13 03:40:58,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-13 03:40:58,099 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 140 [2018-04-13 03:40:58,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:40:58,100 INFO L225 Difference]: With dead ends: 157 [2018-04-13 03:40:58,100 INFO L226 Difference]: Without dead ends: 157 [2018-04-13 03:40:58,100 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 115 SyntacticMatches, 4 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1341 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=361, Invalid=4895, Unknown=0, NotChecked=0, Total=5256 [2018-04-13 03:40:58,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-04-13 03:40:58,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 156. [2018-04-13 03:40:58,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-04-13 03:40:58,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2018-04-13 03:40:58,102 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 140 [2018-04-13 03:40:58,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:40:58,103 INFO L459 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2018-04-13 03:40:58,103 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-04-13 03:40:58,103 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2018-04-13 03:40:58,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-04-13 03:40:58,103 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:40:58,103 INFO L355 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:40:58,103 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolationMEMORY_LEAK]=== [2018-04-13 03:40:58,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1551691892, now seen corresponding path program 17 times [2018-04-13 03:40:58,103 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:40:58,104 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:40:58,104 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:58,104 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:40:58,104 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:40:58,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:40:58,117 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:40:58,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:40:58,991 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:40:58,991 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:40:58,991 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 03:40:59,074 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-04-13 03:40:59,075 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:40:59,081 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:40:59,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 03:40:59,089 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:59,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:59,092 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-13 03:40:59,271 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 03:40:59,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:40:59,273 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:59,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:59,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:59,280 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:40:59,323 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 03:40:59,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 03:40:59,325 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:59,326 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:59,332 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:59,332 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:40:59,374 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 03:40:59,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:40:59,376 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:59,377 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:59,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:59,383 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:40:59,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-13 03:40:59,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:40:59,414 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:59,416 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:59,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:59,421 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:40:59,455 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 03:40:59,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:40:59,457 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:59,459 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:59,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:59,465 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:40:59,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-13 03:40:59,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:40:59,499 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:59,501 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:59,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:59,507 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:40:59,570 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 03:40:59,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:40:59,571 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:59,573 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:59,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:59,579 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:40:59,637 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 03:40:59,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:40:59,638 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:59,639 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:59,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:59,645 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:40:59,675 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 03:40:59,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:40:59,677 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:59,679 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:59,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:59,684 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:40:59,715 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 03:40:59,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:40:59,716 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:59,717 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:59,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:59,722 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:40:59,748 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 03:40:59,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 03:40:59,749 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:40:59,750 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:59,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:40:59,754 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:40:59,807 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 03:40:59,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 03:40:59,810 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:40:59,812 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:40:59,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 03:40:59,816 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:34 [2018-04-13 03:40:59,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:40:59,960 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 03:40:59,960 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 46 [2018-04-13 03:40:59,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-04-13 03:40:59,960 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-04-13 03:40:59,961 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=2003, Unknown=0, NotChecked=0, Total=2162 [2018-04-13 03:40:59,961 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 47 states. [2018-04-13 03:41:01,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:41:01,954 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2018-04-13 03:41:01,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-13 03:41:01,954 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 148 [2018-04-13 03:41:01,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:41:01,955 INFO L225 Difference]: With dead ends: 165 [2018-04-13 03:41:01,955 INFO L226 Difference]: Without dead ends: 165 [2018-04-13 03:41:01,956 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 125 SyntacticMatches, 4 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1809 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=464, Invalid=6508, Unknown=0, NotChecked=0, Total=6972 [2018-04-13 03:41:01,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-04-13 03:41:01,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 164. [2018-04-13 03:41:01,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-04-13 03:41:01,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 164 transitions. [2018-04-13 03:41:01,958 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 164 transitions. Word has length 148 [2018-04-13 03:41:01,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:41:01,959 INFO L459 AbstractCegarLoop]: Abstraction has 164 states and 164 transitions. [2018-04-13 03:41:01,959 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-04-13 03:41:01,959 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 164 transitions. [2018-04-13 03:41:01,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-04-13 03:41:01,960 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:41:01,960 INFO L355 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:41:01,960 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolationMEMORY_LEAK]=== [2018-04-13 03:41:01,960 INFO L82 PathProgramCache]: Analyzing trace with hash -2009178461, now seen corresponding path program 18 times [2018-04-13 03:41:01,960 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:41:01,960 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:41:01,961 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:41:01,961 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:41:01,961 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:41:01,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:41:01,987 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:41:03,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:41:03,284 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:41:03,284 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:41:03,285 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 03:41:03,449 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-04-13 03:41:03,450 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:41:03,459 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:41:03,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 03:41:03,483 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:03,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:03,509 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-13 03:41:04,163 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 03:41:04,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 03:41:04,169 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:41:04,171 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:41:04,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 03:41:04,177 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:48 [2018-04-13 03:41:04,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:41:04,322 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 03:41:04,322 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25] total 48 [2018-04-13 03:41:04,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-04-13 03:41:04,323 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-04-13 03:41:04,323 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=2185, Unknown=0, NotChecked=0, Total=2352 [2018-04-13 03:41:04,323 INFO L87 Difference]: Start difference. First operand 164 states and 164 transitions. Second operand 49 states. [2018-04-13 03:41:06,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:41:06,260 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2018-04-13 03:41:06,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-04-13 03:41:06,260 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 156 [2018-04-13 03:41:06,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:41:06,261 INFO L225 Difference]: With dead ends: 173 [2018-04-13 03:41:06,261 INFO L226 Difference]: Without dead ends: 173 [2018-04-13 03:41:06,261 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 133 SyntacticMatches, 4 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1985 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=480, Invalid=7002, Unknown=0, NotChecked=0, Total=7482 [2018-04-13 03:41:06,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-04-13 03:41:06,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 172. [2018-04-13 03:41:06,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-04-13 03:41:06,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 172 transitions. [2018-04-13 03:41:06,263 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 172 transitions. Word has length 156 [2018-04-13 03:41:06,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:41:06,263 INFO L459 AbstractCegarLoop]: Abstraction has 172 states and 172 transitions. [2018-04-13 03:41:06,263 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-04-13 03:41:06,263 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 172 transitions. [2018-04-13 03:41:06,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-04-13 03:41:06,264 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:41:06,264 INFO L355 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:41:06,264 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolationMEMORY_LEAK]=== [2018-04-13 03:41:06,264 INFO L82 PathProgramCache]: Analyzing trace with hash 54668754, now seen corresponding path program 19 times [2018-04-13 03:41:06,264 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:41:06,264 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:41:06,265 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:41:06,265 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:41:06,265 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:41:06,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:41:06,282 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:41:07,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:41:07,260 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:41:07,260 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:41:07,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:41:07,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:41:07,386 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:41:07,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 03:41:07,391 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:07,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:07,402 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-13 03:41:08,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:41:08,039 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 24 treesize of output 32 [2018-04-13 03:41:08,039 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:08,043 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:08,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:08,049 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:26 [2018-04-13 03:41:08,168 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 03:41:08,172 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 03:41:08,172 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:41:08,174 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:41:08,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 03:41:08,180 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:48 [2018-04-13 03:41:08,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:41:08,348 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 03:41:08,348 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 30] total 53 [2018-04-13 03:41:08,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-04-13 03:41:08,348 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-04-13 03:41:08,349 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=2668, Unknown=0, NotChecked=0, Total=2862 [2018-04-13 03:41:08,349 INFO L87 Difference]: Start difference. First operand 172 states and 172 transitions. Second operand 54 states. [2018-04-13 03:41:10,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:41:10,796 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2018-04-13 03:41:10,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-04-13 03:41:10,796 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 164 [2018-04-13 03:41:10,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:41:10,797 INFO L225 Difference]: With dead ends: 181 [2018-04-13 03:41:10,797 INFO L226 Difference]: Without dead ends: 181 [2018-04-13 03:41:10,797 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 136 SyntacticMatches, 4 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2577 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=568, Invalid=8938, Unknown=0, NotChecked=0, Total=9506 [2018-04-13 03:41:10,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-04-13 03:41:10,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 180. [2018-04-13 03:41:10,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-04-13 03:41:10,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 180 transitions. [2018-04-13 03:41:10,800 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 180 transitions. Word has length 164 [2018-04-13 03:41:10,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:41:10,800 INFO L459 AbstractCegarLoop]: Abstraction has 180 states and 180 transitions. [2018-04-13 03:41:10,800 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-04-13 03:41:10,800 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 180 transitions. [2018-04-13 03:41:10,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-04-13 03:41:10,801 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:41:10,801 INFO L355 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:41:10,801 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolationMEMORY_LEAK]=== [2018-04-13 03:41:10,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1503092225, now seen corresponding path program 20 times [2018-04-13 03:41:10,802 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:41:10,802 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:41:10,802 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:41:10,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:41:10,803 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:41:10,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:41:10,820 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:41:12,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:41:12,009 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:41:12,009 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:41:12,009 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 03:41:12,166 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 03:41:12,167 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:41:12,173 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:41:12,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 03:41:12,182 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:12,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:12,196 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-13 03:41:12,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:41:12,821 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 24 treesize of output 32 [2018-04-13 03:41:12,822 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:12,824 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:12,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:12,830 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:26 [2018-04-13 03:41:12,921 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 03:41:12,922 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:41:12,922 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:12,924 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:12,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:12,931 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:25 [2018-04-13 03:41:13,018 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 03:41:13,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 03:41:13,023 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:41:13,025 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:41:13,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 03:41:13,030 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:48 [2018-04-13 03:41:13,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:41:13,193 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 03:41:13,193 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 31] total 56 [2018-04-13 03:41:13,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-04-13 03:41:13,194 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-04-13 03:41:13,194 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=2989, Unknown=0, NotChecked=0, Total=3192 [2018-04-13 03:41:13,194 INFO L87 Difference]: Start difference. First operand 180 states and 180 transitions. Second operand 57 states. [2018-04-13 03:41:15,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:41:15,565 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2018-04-13 03:41:15,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-04-13 03:41:15,565 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 172 [2018-04-13 03:41:15,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:41:15,566 INFO L225 Difference]: With dead ends: 189 [2018-04-13 03:41:15,566 INFO L226 Difference]: Without dead ends: 189 [2018-04-13 03:41:15,567 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 141 SyntacticMatches, 6 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2669 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=559, Invalid=9143, Unknown=0, NotChecked=0, Total=9702 [2018-04-13 03:41:15,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-04-13 03:41:15,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 188. [2018-04-13 03:41:15,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-04-13 03:41:15,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 188 transitions. [2018-04-13 03:41:15,570 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 188 transitions. Word has length 172 [2018-04-13 03:41:15,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:41:15,571 INFO L459 AbstractCegarLoop]: Abstraction has 188 states and 188 transitions. [2018-04-13 03:41:15,571 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-04-13 03:41:15,571 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 188 transitions. [2018-04-13 03:41:15,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-04-13 03:41:15,572 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:41:15,572 INFO L355 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:41:15,572 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolationMEMORY_LEAK]=== [2018-04-13 03:41:15,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1739788496, now seen corresponding path program 21 times [2018-04-13 03:41:15,572 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:41:15,572 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:41:15,573 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:41:15,573 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:41:15,573 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:41:15,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:41:15,603 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:41:16,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:41:16,695 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:41:16,695 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:41:16,696 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 03:41:16,816 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-04-13 03:41:16,816 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:41:16,827 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:41:16,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 03:41:16,832 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:16,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:16,836 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-13 03:41:17,466 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 03:41:17,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:41:17,467 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:17,468 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:17,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:17,473 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:41:17,510 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 03:41:17,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:41:17,511 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:17,513 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:17,517 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:17,517 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:41:17,548 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 03:41:17,549 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:41:17,549 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:17,550 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:17,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:17,554 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:41:17,614 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 03:41:17,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 03:41:17,618 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:41:17,620 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:41:17,624 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 03:41:17,624 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:34 [2018-04-13 03:41:17,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:41:17,804 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 03:41:17,804 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 54 [2018-04-13 03:41:17,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-04-13 03:41:17,805 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-04-13 03:41:17,805 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=2783, Unknown=0, NotChecked=0, Total=2970 [2018-04-13 03:41:17,805 INFO L87 Difference]: Start difference. First operand 188 states and 188 transitions. Second operand 55 states. [2018-04-13 03:41:20,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:41:20,269 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2018-04-13 03:41:20,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-04-13 03:41:20,269 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 180 [2018-04-13 03:41:20,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:41:20,270 INFO L225 Difference]: With dead ends: 197 [2018-04-13 03:41:20,270 INFO L226 Difference]: Without dead ends: 197 [2018-04-13 03:41:20,270 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 153 SyntacticMatches, 4 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2607 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=556, Invalid=9344, Unknown=0, NotChecked=0, Total=9900 [2018-04-13 03:41:20,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-04-13 03:41:20,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 196. [2018-04-13 03:41:20,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-04-13 03:41:20,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2018-04-13 03:41:20,272 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 180 [2018-04-13 03:41:20,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:41:20,272 INFO L459 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2018-04-13 03:41:20,272 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-04-13 03:41:20,272 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2018-04-13 03:41:20,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-04-13 03:41:20,273 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:41:20,273 INFO L355 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:41:20,273 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolationMEMORY_LEAK]=== [2018-04-13 03:41:20,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1299308895, now seen corresponding path program 22 times [2018-04-13 03:41:20,273 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:41:20,273 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:41:20,274 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:41:20,274 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:41:20,274 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:41:20,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:41:20,292 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:41:21,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:41:21,539 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:41:21,539 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:41:21,540 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 03:41:21,785 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 03:41:21,785 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:41:21,793 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:41:21,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:41:21,795 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:21,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:21,797 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-13 03:41:22,528 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 03:41:22,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 03:41:22,532 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:41:22,534 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:41:22,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 03:41:22,540 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:48 [2018-04-13 03:41:22,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:41:22,713 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 03:41:22,713 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30] total 58 [2018-04-13 03:41:22,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-04-13 03:41:22,714 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-04-13 03:41:22,714 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=3175, Unknown=0, NotChecked=0, Total=3422 [2018-04-13 03:41:22,714 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 59 states. [2018-04-13 03:41:25,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:41:25,628 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2018-04-13 03:41:25,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-04-13 03:41:25,629 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 188 [2018-04-13 03:41:25,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:41:25,629 INFO L225 Difference]: With dead ends: 205 [2018-04-13 03:41:25,629 INFO L226 Difference]: Without dead ends: 205 [2018-04-13 03:41:25,630 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 159 SyntacticMatches, 4 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2975 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=671, Invalid=10249, Unknown=0, NotChecked=0, Total=10920 [2018-04-13 03:41:25,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-04-13 03:41:25,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 204. [2018-04-13 03:41:25,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-04-13 03:41:25,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 204 transitions. [2018-04-13 03:41:25,633 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 204 transitions. Word has length 188 [2018-04-13 03:41:25,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:41:25,634 INFO L459 AbstractCegarLoop]: Abstraction has 204 states and 204 transitions. [2018-04-13 03:41:25,634 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-04-13 03:41:25,634 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 204 transitions. [2018-04-13 03:41:25,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-04-13 03:41:25,635 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:41:25,635 INFO L355 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:41:25,635 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolationMEMORY_LEAK]=== [2018-04-13 03:41:25,635 INFO L82 PathProgramCache]: Analyzing trace with hash -2011876210, now seen corresponding path program 23 times [2018-04-13 03:41:25,635 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:41:25,635 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:41:25,636 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:41:25,636 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:41:25,636 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:41:25,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:41:25,659 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:41:26,930 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:41:26,931 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:41:26,931 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:41:26,931 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 03:41:27,257 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-04-13 03:41:27,258 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:41:27,269 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:41:27,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 03:41:27,272 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:27,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:27,275 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-13 03:41:27,983 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 03:41:27,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 03:41:27,987 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:41:27,989 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:41:27,993 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 03:41:27,993 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:34 [2018-04-13 03:41:28,196 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:41:28,196 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 03:41:28,196 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 58 [2018-04-13 03:41:28,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-04-13 03:41:28,196 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-04-13 03:41:28,197 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=3221, Unknown=0, NotChecked=0, Total=3422 [2018-04-13 03:41:28,197 INFO L87 Difference]: Start difference. First operand 204 states and 204 transitions. Second operand 59 states. [2018-04-13 03:41:31,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:41:31,197 INFO L93 Difference]: Finished difference Result 213 states and 213 transitions. [2018-04-13 03:41:31,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-04-13 03:41:31,197 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 196 [2018-04-13 03:41:31,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:41:31,198 INFO L225 Difference]: With dead ends: 213 [2018-04-13 03:41:31,198 INFO L226 Difference]: Without dead ends: 213 [2018-04-13 03:41:31,199 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 166 SyntacticMatches, 5 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3060 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=602, Invalid=10954, Unknown=0, NotChecked=0, Total=11556 [2018-04-13 03:41:31,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-04-13 03:41:31,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 212. [2018-04-13 03:41:31,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-04-13 03:41:31,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 212 transitions. [2018-04-13 03:41:31,202 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 212 transitions. Word has length 196 [2018-04-13 03:41:31,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:41:31,202 INFO L459 AbstractCegarLoop]: Abstraction has 212 states and 212 transitions. [2018-04-13 03:41:31,202 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-04-13 03:41:31,202 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 212 transitions. [2018-04-13 03:41:31,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-04-13 03:41:31,202 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:41:31,203 INFO L355 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:41:31,203 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolationMEMORY_LEAK]=== [2018-04-13 03:41:31,203 INFO L82 PathProgramCache]: Analyzing trace with hash -666507075, now seen corresponding path program 24 times [2018-04-13 03:41:31,203 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:41:31,203 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:41:31,203 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:41:31,203 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:41:31,203 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:41:31,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:41:31,227 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:41:32,637 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:41:32,637 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:41:32,637 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:41:32,638 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 03:41:32,957 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-04-13 03:41:32,957 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:41:32,967 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:41:32,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 8 treesize of output 7 [2018-04-13 03:41:32,980 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:32,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:32,983 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-13 03:41:33,832 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 03:41:33,851 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 03:41:33,851 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:41:33,853 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:41:33,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 03:41:33,859 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:48 [2018-04-13 03:41:34,048 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:41:34,048 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 03:41:34,049 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 31] total 60 [2018-04-13 03:41:34,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-04-13 03:41:34,049 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-04-13 03:41:34,049 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=3448, Unknown=0, NotChecked=0, Total=3660 [2018-04-13 03:41:34,049 INFO L87 Difference]: Start difference. First operand 212 states and 212 transitions. Second operand 61 states. [2018-04-13 03:41:37,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:41:37,275 INFO L93 Difference]: Finished difference Result 221 states and 221 transitions. [2018-04-13 03:41:37,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-04-13 03:41:37,275 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 204 [2018-04-13 03:41:37,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:41:37,276 INFO L225 Difference]: With dead ends: 221 [2018-04-13 03:41:37,276 INFO L226 Difference]: Without dead ends: 221 [2018-04-13 03:41:37,277 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 175 SyntacticMatches, 4 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2800 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=567, Invalid=10353, Unknown=0, NotChecked=0, Total=10920 [2018-04-13 03:41:37,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-04-13 03:41:37,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 220. [2018-04-13 03:41:37,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-04-13 03:41:37,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 220 transitions. [2018-04-13 03:41:37,281 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 220 transitions. Word has length 204 [2018-04-13 03:41:37,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:41:37,281 INFO L459 AbstractCegarLoop]: Abstraction has 220 states and 220 transitions. [2018-04-13 03:41:37,281 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-04-13 03:41:37,281 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 220 transitions. [2018-04-13 03:41:37,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-04-13 03:41:37,282 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:41:37,282 INFO L355 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:41:37,282 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolationMEMORY_LEAK]=== [2018-04-13 03:41:37,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1326644716, now seen corresponding path program 25 times [2018-04-13 03:41:37,283 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:41:37,283 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:41:37,283 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:41:37,283 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:41:37,284 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:41:37,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:41:37,328 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:41:38,575 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:41:38,576 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:41:38,576 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:41:38,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:41:38,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:41:38,848 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:41:38,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 03:41:38,864 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:38,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:38,877 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-13 03:41:39,694 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 03:41:39,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 03:41:39,698 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:41:39,700 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:41:39,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 03:41:39,704 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:48 [2018-04-13 03:41:39,913 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:41:39,913 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 03:41:39,913 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32] total 61 [2018-04-13 03:41:39,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-04-13 03:41:39,914 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-04-13 03:41:39,914 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=3568, Unknown=0, NotChecked=0, Total=3782 [2018-04-13 03:41:39,914 INFO L87 Difference]: Start difference. First operand 220 states and 220 transitions. Second operand 62 states. [2018-04-13 03:41:43,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:41:43,639 INFO L93 Difference]: Finished difference Result 229 states and 229 transitions. [2018-04-13 03:41:43,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-04-13 03:41:43,639 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 212 [2018-04-13 03:41:43,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:41:43,640 INFO L225 Difference]: With dead ends: 229 [2018-04-13 03:41:43,640 INFO L226 Difference]: Without dead ends: 229 [2018-04-13 03:41:43,640 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 180 SyntacticMatches, 6 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3469 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=646, Invalid=12464, Unknown=0, NotChecked=0, Total=13110 [2018-04-13 03:41:43,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-04-13 03:41:43,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 228. [2018-04-13 03:41:43,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-04-13 03:41:43,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 228 transitions. [2018-04-13 03:41:43,643 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 228 transitions. Word has length 212 [2018-04-13 03:41:43,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:41:43,643 INFO L459 AbstractCegarLoop]: Abstraction has 228 states and 228 transitions. [2018-04-13 03:41:43,643 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-04-13 03:41:43,643 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 228 transitions. [2018-04-13 03:41:43,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-04-13 03:41:43,643 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:41:43,644 INFO L355 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:41:43,644 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolationMEMORY_LEAK]=== [2018-04-13 03:41:43,644 INFO L82 PathProgramCache]: Analyzing trace with hash 2123068443, now seen corresponding path program 26 times [2018-04-13 03:41:43,644 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:41:43,644 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:41:43,644 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:41:43,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:41:43,644 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:41:43,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:41:43,672 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:41:44,990 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:41:44,990 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:41:44,990 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:41:44,990 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 03:41:45,241 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 03:41:45,241 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:41:45,249 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:41:45,251 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 03:41:45,251 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:45,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:45,253 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-13 03:41:45,484 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 03:41:45,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:41:45,485 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:45,486 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:45,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:45,491 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:41:45,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 03:41:45,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:41:45,522 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:45,523 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:45,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:45,527 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:41:45,563 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 03:41:45,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:41:45,564 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:45,565 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:45,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:45,571 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:41:45,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-13 03:41:45,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:41:45,604 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:45,606 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:45,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:45,612 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:41:45,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 03:41:45,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:41:45,657 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:45,667 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:45,672 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:45,672 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:41:45,706 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 03:41:45,707 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:41:45,707 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:45,708 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:45,712 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:45,713 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:41:45,744 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 03:41:45,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:41:45,745 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:45,746 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:45,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:45,750 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:41:45,781 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 03:41:45,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 03:41:45,783 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:45,783 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:45,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:45,788 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:41:45,820 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 03:41:45,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:41:45,821 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:45,822 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:45,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:45,826 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:41:45,857 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 03:41:45,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:41:45,859 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:45,860 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:45,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:45,864 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:41:45,900 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 03:41:45,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:41:45,903 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:45,904 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:45,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:45,908 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:41:45,943 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 03:41:45,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:41:45,944 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:45,951 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:45,956 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:45,956 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:41:45,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, 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 03:41:45,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:41:45,993 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:45,994 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:45,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:45,998 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:41:46,034 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 03:41:46,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:41:46,035 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:46,036 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:46,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:46,040 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:41:46,074 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 03:41:46,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:41:46,075 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:46,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:46,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:46,080 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:41:46,114 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 03:41:46,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:41:46,115 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:46,116 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:46,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:46,120 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:41:46,184 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 03:41:46,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:41:46,185 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:46,186 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:46,192 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:46,193 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:41:46,273 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 03:41:46,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 03:41:46,277 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:41:46,279 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:41:46,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 03:41:46,284 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:48 [2018-04-13 03:41:46,501 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:41:46,501 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 03:41:46,502 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 33] total 64 [2018-04-13 03:41:46,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-04-13 03:41:46,502 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-04-13 03:41:46,502 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=3934, Unknown=0, NotChecked=0, Total=4160 [2018-04-13 03:41:46,502 INFO L87 Difference]: Start difference. First operand 228 states and 228 transitions. Second operand 65 states. [2018-04-13 03:41:50,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:41:50,420 INFO L93 Difference]: Finished difference Result 237 states and 237 transitions. [2018-04-13 03:41:50,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-04-13 03:41:50,420 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 220 [2018-04-13 03:41:50,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:41:50,421 INFO L225 Difference]: With dead ends: 237 [2018-04-13 03:41:50,421 INFO L226 Difference]: Without dead ends: 237 [2018-04-13 03:41:50,422 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 187 SyntacticMatches, 6 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3757 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=667, Invalid=13375, Unknown=0, NotChecked=0, Total=14042 [2018-04-13 03:41:50,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-04-13 03:41:50,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 236. [2018-04-13 03:41:50,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-04-13 03:41:50,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 236 transitions. [2018-04-13 03:41:50,425 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 236 transitions. Word has length 220 [2018-04-13 03:41:50,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:41:50,425 INFO L459 AbstractCegarLoop]: Abstraction has 236 states and 236 transitions. [2018-04-13 03:41:50,425 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-04-13 03:41:50,425 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 236 transitions. [2018-04-13 03:41:50,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-04-13 03:41:50,426 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:41:50,427 INFO L355 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:41:50,427 INFO L408 AbstractCegarLoop]: === Iteration 33 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolationMEMORY_LEAK]=== [2018-04-13 03:41:50,427 INFO L82 PathProgramCache]: Analyzing trace with hash 2042514250, now seen corresponding path program 27 times [2018-04-13 03:41:50,427 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:41:50,427 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:41:50,427 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:41:50,428 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:41:50,428 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:41:50,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:41:50,462 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:41:51,695 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:41:51,695 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:41:51,695 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:41:51,696 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 03:41:51,811 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-04-13 03:41:51,811 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:41:51,817 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:41:51,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 03:41:51,819 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:51,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:51,822 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-13 03:41:52,753 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 03:41:52,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 03:41:52,757 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:41:52,760 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:41:52,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 03:41:52,764 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:34 [2018-04-13 03:41:53,019 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:41:53,019 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 03:41:53,019 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 66 [2018-04-13 03:41:53,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-04-13 03:41:53,020 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-04-13 03:41:53,020 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=4196, Unknown=0, NotChecked=0, Total=4422 [2018-04-13 03:41:53,020 INFO L87 Difference]: Start difference. First operand 236 states and 236 transitions. Second operand 67 states. [2018-04-13 03:41:57,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:41:57,049 INFO L93 Difference]: Finished difference Result 245 states and 245 transitions. [2018-04-13 03:41:57,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-04-13 03:41:57,050 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 228 [2018-04-13 03:41:57,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:41:57,050 INFO L225 Difference]: With dead ends: 245 [2018-04-13 03:41:57,050 INFO L226 Difference]: Without dead ends: 245 [2018-04-13 03:41:57,051 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 195 SyntacticMatches, 4 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4143 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=691, Invalid=14561, Unknown=0, NotChecked=0, Total=15252 [2018-04-13 03:41:57,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-04-13 03:41:57,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 244. [2018-04-13 03:41:57,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-04-13 03:41:57,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 244 transitions. [2018-04-13 03:41:57,054 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 244 transitions. Word has length 228 [2018-04-13 03:41:57,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:41:57,054 INFO L459 AbstractCegarLoop]: Abstraction has 244 states and 244 transitions. [2018-04-13 03:41:57,054 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-04-13 03:41:57,054 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 244 transitions. [2018-04-13 03:41:57,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-04-13 03:41:57,055 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:41:57,055 INFO L355 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:41:57,055 INFO L408 AbstractCegarLoop]: === Iteration 34 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolationMEMORY_LEAK]=== [2018-04-13 03:41:57,055 INFO L82 PathProgramCache]: Analyzing trace with hash -725974151, now seen corresponding path program 28 times [2018-04-13 03:41:57,055 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:41:57,056 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:41:57,056 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:41:57,056 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:41:57,056 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:41:57,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:41:57,091 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:41:58,527 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:41:58,528 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:41:58,528 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:41:58,528 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 03:41:59,142 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 03:41:59,142 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:41:59,155 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:41:59,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:41:59,169 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:41:59,172 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:41:59,172 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-13 03:42:00,278 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 03:42:00,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 03:42:00,281 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:42:00,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:42:00,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 03:42:00,288 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:48 [2018-04-13 03:42:00,512 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:42:00,512 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 03:42:00,512 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 35] total 68 [2018-04-13 03:42:00,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-04-13 03:42:00,513 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-04-13 03:42:00,513 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=4452, Unknown=0, NotChecked=0, Total=4692 [2018-04-13 03:42:00,513 INFO L87 Difference]: Start difference. First operand 244 states and 244 transitions. Second operand 69 states. [2018-04-13 03:42:04,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:42:04,919 INFO L93 Difference]: Finished difference Result 253 states and 253 transitions. [2018-04-13 03:42:04,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-04-13 03:42:04,920 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 236 [2018-04-13 03:42:04,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:42:04,920 INFO L225 Difference]: With dead ends: 253 [2018-04-13 03:42:04,920 INFO L226 Difference]: Without dead ends: 253 [2018-04-13 03:42:04,921 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 202 SyntacticMatches, 5 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4123 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=695, Invalid=14805, Unknown=0, NotChecked=0, Total=15500 [2018-04-13 03:42:04,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-04-13 03:42:04,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 252. [2018-04-13 03:42:04,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-04-13 03:42:04,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 252 transitions. [2018-04-13 03:42:04,922 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 252 transitions. Word has length 236 [2018-04-13 03:42:04,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:42:04,923 INFO L459 AbstractCegarLoop]: Abstraction has 252 states and 252 transitions. [2018-04-13 03:42:04,923 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-04-13 03:42:04,923 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 252 transitions. [2018-04-13 03:42:04,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-04-13 03:42:04,923 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:42:04,923 INFO L355 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:42:04,923 INFO L408 AbstractCegarLoop]: === Iteration 35 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolationMEMORY_LEAK]=== [2018-04-13 03:42:04,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1534124888, now seen corresponding path program 29 times [2018-04-13 03:42:04,924 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:42:04,924 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:42:04,924 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:42:04,924 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:42:04,924 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:42:04,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:42:04,953 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:42:06,393 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:42:06,394 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:42:06,394 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:42:06,394 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 03:42:06,836 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-04-13 03:42:06,836 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:42:06,846 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:42:06,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 03:42:06,848 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:42:06,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:42:06,849 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-13 03:42:07,871 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 03:42:07,875 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 03:42:07,875 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:42:07,877 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:42:07,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 03:42:07,881 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:34 [2018-04-13 03:42:08,145 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:42:08,145 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 03:42:08,145 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 70 [2018-04-13 03:42:08,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-04-13 03:42:08,146 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-04-13 03:42:08,146 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=4727, Unknown=0, NotChecked=0, Total=4970 [2018-04-13 03:42:08,146 INFO L87 Difference]: Start difference. First operand 252 states and 252 transitions. Second operand 71 states. [2018-04-13 03:42:12,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:42:12,370 INFO L93 Difference]: Finished difference Result 261 states and 261 transitions. [2018-04-13 03:42:12,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-04-13 03:42:12,371 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 244 [2018-04-13 03:42:12,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:42:12,371 INFO L225 Difference]: With dead ends: 261 [2018-04-13 03:42:12,371 INFO L226 Difference]: Without dead ends: 261 [2018-04-13 03:42:12,372 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 209 SyntacticMatches, 4 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4635 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=740, Invalid=16552, Unknown=0, NotChecked=0, Total=17292 [2018-04-13 03:42:12,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-04-13 03:42:12,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 260. [2018-04-13 03:42:12,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-04-13 03:42:12,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 260 transitions. [2018-04-13 03:42:12,374 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 260 transitions. Word has length 244 [2018-04-13 03:42:12,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:42:12,374 INFO L459 AbstractCegarLoop]: Abstraction has 260 states and 260 transitions. [2018-04-13 03:42:12,374 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-04-13 03:42:12,374 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 260 transitions. [2018-04-13 03:42:12,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-04-13 03:42:12,375 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:42:12,375 INFO L355 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:42:12,375 INFO L408 AbstractCegarLoop]: === Iteration 36 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolationMEMORY_LEAK]=== [2018-04-13 03:42:12,375 INFO L82 PathProgramCache]: Analyzing trace with hash 2135627479, now seen corresponding path program 30 times [2018-04-13 03:42:12,375 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:42:12,375 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:42:12,376 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:42:12,376 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:42:12,376 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:42:12,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:42:12,410 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:42:14,051 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:42:14,051 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:42:14,051 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:42:14,051 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 03:42:14,340 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-04-13 03:42:14,340 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:42:14,351 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:42:14,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 03:42:14,354 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:42:14,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:42:14,364 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-13 03:42:15,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-13 03:42:15,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 03:42:15,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:42:15,511 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:42:15,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 03:42:15,516 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:48 [2018-04-13 03:42:15,759 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:42:15,759 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 03:42:15,759 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 37] total 72 [2018-04-13 03:42:15,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-04-13 03:42:15,759 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-04-13 03:42:15,760 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=5002, Unknown=0, NotChecked=0, Total=5256 [2018-04-13 03:42:15,760 INFO L87 Difference]: Start difference. First operand 260 states and 260 transitions. Second operand 73 states. [2018-04-13 03:42:20,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:42:20,391 INFO L93 Difference]: Finished difference Result 269 states and 269 transitions. [2018-04-13 03:42:20,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-04-13 03:42:20,392 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 252 [2018-04-13 03:42:20,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:42:20,392 INFO L225 Difference]: With dead ends: 269 [2018-04-13 03:42:20,392 INFO L226 Difference]: Without dead ends: 269 [2018-04-13 03:42:20,393 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 217 SyntacticMatches, 4 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4840 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=759, Invalid=17331, Unknown=0, NotChecked=0, Total=18090 [2018-04-13 03:42:20,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-04-13 03:42:20,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 268. [2018-04-13 03:42:20,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-04-13 03:42:20,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 268 transitions. [2018-04-13 03:42:20,395 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 268 transitions. Word has length 252 [2018-04-13 03:42:20,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:42:20,395 INFO L459 AbstractCegarLoop]: Abstraction has 268 states and 268 transitions. [2018-04-13 03:42:20,395 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-04-13 03:42:20,395 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 268 transitions. [2018-04-13 03:42:20,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-04-13 03:42:20,396 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:42:20,396 INFO L355 BasicCegarLoop]: trace histogram [32, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:42:20,396 INFO L408 AbstractCegarLoop]: === Iteration 37 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolationMEMORY_LEAK]=== [2018-04-13 03:42:20,396 INFO L82 PathProgramCache]: Analyzing trace with hash 2080207366, now seen corresponding path program 31 times [2018-04-13 03:42:20,396 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:42:20,396 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:42:20,397 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:42:20,397 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:42:20,397 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:42:20,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:42:20,429 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:42:22,029 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:42:22,029 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:42:22,029 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:42:22,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:42:22,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:42:22,779 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:42:22,902 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 20 treesize of output 19 [2018-04-13 03:42:22,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-04-13 03:42:22,906 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:42:22,908 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:42:22,914 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:42:22,915 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:57 [2018-04-13 03:42:23,132 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:42:23,137 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 24 treesize of output 32 [2018-04-13 03:42:23,137 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:42:23,140 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:42:23,149 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:42:23,149 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:60, output treesize:39 [2018-04-13 03:42:23,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:42:23,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2018-04-13 03:42:23,396 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:42:23,399 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:42:23,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:42:23,407 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:66, output treesize:45 [2018-04-13 03:42:23,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:42:23,627 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 24 treesize of output 34 [2018-04-13 03:42:23,628 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:42:23,631 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:42:23,641 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:42:23,641 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:72, output treesize:51 [2018-04-13 03:42:23,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:42:23,871 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 24 treesize of output 34 [2018-04-13 03:42:23,871 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:42:23,874 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:42:23,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:42:23,884 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:78, output treesize:57 [2018-04-13 03:42:24,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:42:24,159 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 24 treesize of output 34 [2018-04-13 03:42:24,159 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:42:24,163 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:42:24,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:42:24,175 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:84, output treesize:63 [2018-04-13 03:42:24,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:42:24,472 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 24 treesize of output 32 [2018-04-13 03:42:24,473 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:42:24,476 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:42:24,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:42:24,490 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:90, output treesize:69 [2018-04-13 03:42:24,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:42:24,808 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 24 treesize of output 32 [2018-04-13 03:42:24,808 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:42:24,811 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:42:24,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:42:24,826 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:96, output treesize:75 [2018-04-13 03:42:25,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:42:25,168 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 24 treesize of output 34 [2018-04-13 03:42:25,168 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:42:25,172 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:42:25,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:42:25,188 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:102, output treesize:81 [2018-04-13 03:42:25,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:42:25,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 34 [2018-04-13 03:42:25,564 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:42:25,567 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:42:25,583 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:42:25,583 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:108, output treesize:87 [2018-04-13 03:42:25,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:42:25,982 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 24 treesize of output 34 [2018-04-13 03:42:25,983 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:42:25,986 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:42:26,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:42:26,005 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:114, output treesize:93 [2018-04-13 03:42:26,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:42:26,470 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 24 treesize of output 32 [2018-04-13 03:42:26,471 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:42:26,474 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:42:26,497 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:42:26,497 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:120, output treesize:99 [2018-04-13 03:42:27,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:42:27,054 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 24 treesize of output 32 [2018-04-13 03:42:27,054 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:42:27,058 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:42:27,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:42:27,080 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:126, output treesize:105 [2018-04-13 03:42:27,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, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:42:27,598 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 24 treesize of output 34 [2018-04-13 03:42:27,599 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:42:27,602 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:42:27,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:42:27,627 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:132, output treesize:111 [2018-04-13 03:42:28,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:42:28,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2018-04-13 03:42:28,215 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:42:28,218 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:42:28,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:42:28,242 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:138, output treesize:117 [2018-04-13 03:42:28,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:42:28,909 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 24 treesize of output 34 [2018-04-13 03:42:28,910 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:42:28,913 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:42:28,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:42:28,945 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:144, output treesize:123 [2018-04-13 03:42:29,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:42:29,571 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 24 treesize of output 32 [2018-04-13 03:42:29,572 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:42:29,575 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:42:29,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:42:29,603 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:150, output treesize:129 [2018-04-13 03:42:30,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:42:30,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 24 treesize of output 34 [2018-04-13 03:42:30,284 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:42:30,288 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:42:30,321 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:42:30,321 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:156, output treesize:135 [2018-04-13 03:42:31,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:42:31,109 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 24 treesize of output 34 [2018-04-13 03:42:31,109 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:42:31,113 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:42:31,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:42:31,145 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:162, output treesize:141 [2018-04-13 03:42:31,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:42:31,903 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 24 treesize of output 34 [2018-04-13 03:42:31,903 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:42:31,907 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:42:31,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:42:31,942 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:168, output treesize:147 [2018-04-13 03:42:32,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:42:32,765 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 24 treesize of output 34 [2018-04-13 03:42:32,765 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:42:32,768 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:42:32,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:42:32,806 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:174, output treesize:153 [2018-04-13 03:42:33,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:42:33,664 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 24 treesize of output 32 [2018-04-13 03:42:33,664 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:42:33,668 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:42:33,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:42:33,708 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:180, output treesize:159 [2018-04-13 03:42:34,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:42:34,652 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 24 treesize of output 34 [2018-04-13 03:42:34,652 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:42:34,656 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:42:34,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:42:34,696 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:186, output treesize:165 [2018-04-13 03:42:35,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:42:35,749 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 24 treesize of output 32 [2018-04-13 03:42:35,749 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:42:35,753 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:42:35,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:42:35,793 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:192, output treesize:171 [2018-04-13 03:42:36,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:42:36,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 34 [2018-04-13 03:42:36,806 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:42:36,810 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:42:36,856 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:42:36,856 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:198, output treesize:177 [2018-04-13 03:42:37,916 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:42:37,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 34 [2018-04-13 03:42:37,920 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:42:37,924 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:42:37,978 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:42:37,978 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:204, output treesize:183 [2018-04-13 03:42:39,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:42:39,094 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 24 treesize of output 34 [2018-04-13 03:42:39,094 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:42:39,098 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:42:39,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:42:39,144 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:210, output treesize:189 [2018-04-13 03:42:40,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:42:40,381 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 24 treesize of output 34 [2018-04-13 03:42:40,409 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:42:40,413 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:42:40,465 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:42:40,465 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:216, output treesize:195 [2018-04-13 03:42:41,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:42:41,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 34 [2018-04-13 03:42:41,693 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:42:41,697 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:42:41,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:42:41,752 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:222, output treesize:201 [2018-04-13 03:42:43,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:42:43,085 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 24 treesize of output 32 [2018-04-13 03:42:43,085 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:42:43,089 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:42:43,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:42:43,155 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:228, output treesize:207 [2018-04-13 03:42:44,039 WARN L151 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 114 DAG size of output 113 [2018-04-13 03:42:44,044 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 03:42:44,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 03:42:44,057 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:42:44,061 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:42:44,116 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 03:42:44,116 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:212, output treesize:400 [2018-04-13 03:42:45,490 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:42:45,490 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 03:42:45,490 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 158] total 196 [2018-04-13 03:42:45,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 197 states [2018-04-13 03:42:45,491 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 197 interpolants. [2018-04-13 03:42:45,492 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1132, Invalid=37480, Unknown=0, NotChecked=0, Total=38612 [2018-04-13 03:42:45,492 INFO L87 Difference]: Start difference. First operand 268 states and 268 transitions. Second operand 197 states. [2018-04-13 03:42:55,982 WARN L151 SmtUtils]: Spent 128ms on a formula simplification. DAG size of input: 87 DAG size of output 76 [2018-04-13 03:43:00,871 WARN L151 SmtUtils]: Spent 133ms on a formula simplification. DAG size of input: 96 DAG size of output 86 [2018-04-13 03:43:01,439 WARN L151 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 107 DAG size of output 96 [2018-04-13 03:43:01,827 WARN L151 SmtUtils]: Spent 161ms on a formula simplification. DAG size of input: 105 DAG size of output 94 [2018-04-13 03:43:04,852 WARN L151 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 116 DAG size of output 105 [2018-04-13 03:43:05,784 WARN L151 SmtUtils]: Spent 162ms on a formula simplification. DAG size of input: 113 DAG size of output 102 [2018-04-13 03:43:06,002 WARN L151 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 119 DAG size of output 108 [2018-04-13 03:43:06,218 WARN L151 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 117 DAG size of output 106 [2018-04-13 03:43:06,930 WARN L151 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 116 DAG size of output 105 [2018-04-13 03:43:07,152 WARN L151 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 122 DAG size of output 111 [2018-04-13 03:43:07,372 WARN L151 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 120 DAG size of output 109 [2018-04-13 03:43:07,661 WARN L151 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 114 DAG size of output 104 [2018-04-13 03:43:07,874 WARN L151 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 114 DAG size of output 103 [2018-04-13 03:43:08,105 WARN L151 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 119 DAG size of output 108 [2018-04-13 03:43:08,345 WARN L151 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 125 DAG size of output 114 [2018-04-13 03:43:08,567 WARN L151 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 123 DAG size of output 112 [2018-04-13 03:43:08,865 WARN L151 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 117 DAG size of output 107 [2018-04-13 03:43:09,092 WARN L151 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 117 DAG size of output 106 [2018-04-13 03:43:09,330 WARN L151 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 122 DAG size of output 111 [2018-04-13 03:43:09,569 WARN L151 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 128 DAG size of output 117 [2018-04-13 03:43:09,801 WARN L151 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 126 DAG size of output 115 [2018-04-13 03:43:10,100 WARN L151 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 120 DAG size of output 110 [2018-04-13 03:43:10,331 WARN L151 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 120 DAG size of output 109 [2018-04-13 03:43:10,577 WARN L151 SmtUtils]: Spent 130ms on a formula simplification. DAG size of input: 125 DAG size of output 114 [2018-04-13 03:43:10,903 WARN L151 SmtUtils]: Spent 130ms on a formula simplification. DAG size of input: 131 DAG size of output 120 [2018-04-13 03:43:11,151 WARN L151 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 129 DAG size of output 118 [2018-04-13 03:43:11,457 WARN L151 SmtUtils]: Spent 123ms on a formula simplification. DAG size of input: 123 DAG size of output 113 [2018-04-13 03:43:11,696 WARN L151 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 123 DAG size of output 112 [2018-04-13 03:43:12,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:43:12,857 INFO L93 Difference]: Finished difference Result 277 states and 277 transitions. [2018-04-13 03:43:12,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2018-04-13 03:43:12,857 INFO L78 Accepts]: Start accepts. Automaton has 197 states. Word has length 260 [2018-04-13 03:43:12,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:43:12,858 INFO L225 Difference]: With dead ends: 277 [2018-04-13 03:43:12,858 INFO L226 Difference]: Without dead ends: 277 [2018-04-13 03:43:12,860 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 351 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48215 ImplicationChecksByTransitivity, 41.9s TimeCoverageRelationStatistics Valid=3420, Invalid=120836, Unknown=0, NotChecked=0, Total=124256 [2018-04-13 03:43:12,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-04-13 03:43:12,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 276. [2018-04-13 03:43:12,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-04-13 03:43:12,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 276 transitions. [2018-04-13 03:43:12,862 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 276 transitions. Word has length 260 [2018-04-13 03:43:12,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:43:12,862 INFO L459 AbstractCegarLoop]: Abstraction has 276 states and 276 transitions. [2018-04-13 03:43:12,862 INFO L460 AbstractCegarLoop]: Interpolant automaton has 197 states. [2018-04-13 03:43:12,862 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 276 transitions. [2018-04-13 03:43:12,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-04-13 03:43:12,863 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:43:12,863 INFO L355 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:43:12,863 INFO L408 AbstractCegarLoop]: === Iteration 38 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolationMEMORY_LEAK]=== [2018-04-13 03:43:12,863 INFO L82 PathProgramCache]: Analyzing trace with hash 850734645, now seen corresponding path program 32 times [2018-04-13 03:43:12,863 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:43:12,863 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:43:12,863 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:43:12,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:43:12,864 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:43:12,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:43:12,898 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:43:14,422 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:43:14,423 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:43:14,423 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:43:14,423 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 03:43:14,835 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 03:43:14,835 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:43:14,844 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:43:14,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 03:43:14,848 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:43:14,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:43:14,851 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-13 03:43:15,515 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 03:43:15,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:43:15,517 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:43:15,518 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:43:15,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:43:15,523 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:43:15,697 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:43:15,700 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 24 treesize of output 32 [2018-04-13 03:43:15,700 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:43:15,703 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:43:15,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:43:15,708 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:26 [2018-04-13 03:43:15,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:43:15,961 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 24 treesize of output 32 [2018-04-13 03:43:15,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:43:15,964 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:43:15,970 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:43:15,970 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:34 [2018-04-13 03:43:16,062 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 03:43:16,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 10 treesize of output 9 [2018-04-13 03:43:16,063 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:43:16,064 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:43:16,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:43:16,071 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:33 [2018-04-13 03:43:16,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:43:16,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2018-04-13 03:43:16,297 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:43:16,299 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:43:16,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:43:16,306 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:42 [2018-04-13 03:43:16,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 03:43:16,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:43:16,416 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:43:16,417 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:43:16,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:43:16,425 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:41 [2018-04-13 03:43:16,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:43:16,659 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 24 treesize of output 32 [2018-04-13 03:43:16,660 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:43:16,662 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:43:16,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:43:16,670 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:71, output treesize:50 [2018-04-13 03:43:16,793 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 03:43:16,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 03:43:16,795 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:43:16,796 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:43:16,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:43:16,804 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:62, output treesize:49 [2018-04-13 03:43:16,862 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 03:43:16,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:43:16,863 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:43:16,865 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:43:16,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:43:16,873 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:62, output treesize:49 [2018-04-13 03:43:16,937 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 03:43:16,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:43:16,938 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:43:16,940 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:43:16,948 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:43:16,948 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:62, output treesize:49 [2018-04-13 03:43:17,021 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 03:43:17,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 10 treesize of output 9 [2018-04-13 03:43:17,023 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:43:17,024 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:43:17,033 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:43:17,033 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:62, output treesize:49 [2018-04-13 03:43:17,174 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 03:43:17,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 03:43:17,178 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:43:17,180 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:43:17,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 03:43:17,185 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:48 [2018-04-13 03:43:17,512 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:43:17,512 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 03:43:17,512 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 55] total 91 [2018-04-13 03:43:17,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-04-13 03:43:17,513 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-04-13 03:43:17,513 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=348, Invalid=8024, Unknown=0, NotChecked=0, Total=8372 [2018-04-13 03:43:17,513 INFO L87 Difference]: Start difference. First operand 276 states and 276 transitions. Second operand 92 states. [2018-04-13 03:43:22,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:43:22,919 INFO L93 Difference]: Finished difference Result 285 states and 285 transitions. [2018-04-13 03:43:22,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-04-13 03:43:22,919 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 268 [2018-04-13 03:43:22,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:43:22,920 INFO L225 Difference]: With dead ends: 285 [2018-04-13 03:43:22,920 INFO L226 Difference]: Without dead ends: 285 [2018-04-13 03:43:22,920 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 214 SyntacticMatches, 5 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5779 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=779, Invalid=20101, Unknown=0, NotChecked=0, Total=20880 [2018-04-13 03:43:22,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-04-13 03:43:22,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 284. [2018-04-13 03:43:22,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-04-13 03:43:22,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 284 transitions. [2018-04-13 03:43:22,923 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 284 transitions. Word has length 268 [2018-04-13 03:43:22,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:43:22,923 INFO L459 AbstractCegarLoop]: Abstraction has 284 states and 284 transitions. [2018-04-13 03:43:22,923 INFO L460 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-04-13 03:43:22,923 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 284 transitions. [2018-04-13 03:43:22,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-04-13 03:43:22,924 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:43:22,924 INFO L355 BasicCegarLoop]: trace histogram [34, 33, 33, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:43:22,924 INFO L408 AbstractCegarLoop]: === Iteration 39 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolationMEMORY_LEAK]=== [2018-04-13 03:43:22,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1132377244, now seen corresponding path program 33 times [2018-04-13 03:43:22,924 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:43:22,924 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:43:22,925 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:43:22,925 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:43:22,925 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:43:22,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:43:22,963 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:43:24,705 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:43:24,706 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:43:24,706 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:43:24,706 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 03:43:24,859 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-04-13 03:43:24,859 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:43:24,871 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:43:24,873 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 03:43:24,873 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:43:24,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:43:24,875 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-13 03:43:25,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-13 03:43:25,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 10 treesize of output 9 [2018-04-13 03:43:25,632 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:43:25,633 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:43:25,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:43:25,637 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:43:25,675 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 03:43:25,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:43:25,676 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:43:25,677 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:43:25,682 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:43:25,682 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:43:25,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 03:43:25,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, 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 03:43:25,724 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:43:25,725 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:43:25,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:43:25,729 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:43:25,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-13 03:43:25,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 10 treesize of output 9 [2018-04-13 03:43:25,773 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:43:25,774 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:43:25,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:43:25,779 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:43:25,820 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 03:43:25,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:43:25,822 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:43:25,823 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:43:25,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:43:25,827 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:43:25,866 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 03:43:25,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 10 treesize of output 9 [2018-04-13 03:43:25,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:43:25,869 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:43:25,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:43:25,873 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:43:25,915 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 03:43:25,916 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:43:25,916 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:43:25,917 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:43:25,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:43:25,922 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:43:25,961 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 03:43:25,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 03:43:25,963 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:43:25,964 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:43:25,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:43:25,968 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:43:26,008 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 03:43:26,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:43:26,010 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:43:26,011 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:43:26,016 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:43:26,016 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:43:26,059 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 03:43:26,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:43:26,060 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:43:26,061 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:43:26,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:43:26,066 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:43:26,107 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-13 03:43:26,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:43:26,108 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:43:26,110 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:43:26,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:43:26,122 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:43:26,212 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 03:43:26,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 03:43:26,217 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:43:26,219 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:43:26,224 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 03:43:26,224 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:34 [2018-04-13 03:43:26,541 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:43:26,541 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 03:43:26,541 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 42] total 79 [2018-04-13 03:43:26,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-04-13 03:43:26,541 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-04-13 03:43:26,542 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=6045, Unknown=0, NotChecked=0, Total=6320 [2018-04-13 03:43:26,542 INFO L87 Difference]: Start difference. First operand 284 states and 284 transitions. Second operand 80 states. [2018-04-13 03:43:32,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:43:32,572 INFO L93 Difference]: Finished difference Result 293 states and 293 transitions. [2018-04-13 03:43:32,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-04-13 03:43:32,572 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 276 [2018-04-13 03:43:32,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:43:32,573 INFO L225 Difference]: With dead ends: 293 [2018-04-13 03:43:32,573 INFO L226 Difference]: Without dead ends: 293 [2018-04-13 03:43:32,574 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 236 SyntacticMatches, 4 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5911 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=837, Invalid=21215, Unknown=0, NotChecked=0, Total=22052 [2018-04-13 03:43:32,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-04-13 03:43:32,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 292. [2018-04-13 03:43:32,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-04-13 03:43:32,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 292 transitions. [2018-04-13 03:43:32,576 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 292 transitions. Word has length 276 [2018-04-13 03:43:32,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:43:32,577 INFO L459 AbstractCegarLoop]: Abstraction has 292 states and 292 transitions. [2018-04-13 03:43:32,577 INFO L460 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-04-13 03:43:32,577 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 292 transitions. [2018-04-13 03:43:32,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-04-13 03:43:32,577 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:43:32,577 INFO L355 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:43:32,577 INFO L408 AbstractCegarLoop]: === Iteration 40 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolationMEMORY_LEAK]=== [2018-04-13 03:43:32,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1284453997, now seen corresponding path program 34 times [2018-04-13 03:43:32,578 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:43:32,578 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:43:32,578 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:43:32,578 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:43:32,578 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:43:32,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:43:32,649 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:43:34,524 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:43:34,524 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:43:34,524 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:43:34,525 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 03:43:34,913 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 03:43:34,913 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:43:34,922 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:43:34,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:43:34,923 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:43:34,925 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:43:34,926 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-13 03:43:36,364 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 03:43:36,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 03:43:36,367 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:43:36,369 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:43:36,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 03:43:36,374 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:48 [2018-04-13 03:43:36,670 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:43:36,670 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 03:43:36,670 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 41] total 80 [2018-04-13 03:43:36,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-04-13 03:43:36,670 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-04-13 03:43:36,671 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=6201, Unknown=0, NotChecked=0, Total=6480 [2018-04-13 03:43:36,671 INFO L87 Difference]: Start difference. First operand 292 states and 292 transitions. Second operand 81 states. [2018-04-13 03:43:42,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:43:42,609 INFO L93 Difference]: Finished difference Result 301 states and 301 transitions. [2018-04-13 03:43:42,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-04-13 03:43:42,609 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 284 [2018-04-13 03:43:42,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:43:42,610 INFO L225 Difference]: With dead ends: 301 [2018-04-13 03:43:42,610 INFO L226 Difference]: Without dead ends: 301 [2018-04-13 03:43:42,611 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 243 SyntacticMatches, 6 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6220 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=848, Invalid=21802, Unknown=0, NotChecked=0, Total=22650 [2018-04-13 03:43:42,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-04-13 03:43:42,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 300. [2018-04-13 03:43:42,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-04-13 03:43:42,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 300 transitions. [2018-04-13 03:43:42,613 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 300 transitions. Word has length 284 [2018-04-13 03:43:42,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:43:42,613 INFO L459 AbstractCegarLoop]: Abstraction has 300 states and 300 transitions. [2018-04-13 03:43:42,613 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-04-13 03:43:42,613 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 300 transitions. [2018-04-13 03:43:42,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-04-13 03:43:42,614 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:43:42,614 INFO L355 BasicCegarLoop]: trace histogram [36, 35, 35, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:43:42,614 INFO L408 AbstractCegarLoop]: === Iteration 41 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolationMEMORY_LEAK]=== [2018-04-13 03:43:42,614 INFO L82 PathProgramCache]: Analyzing trace with hash 848472258, now seen corresponding path program 35 times [2018-04-13 03:43:42,614 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:43:42,614 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:43:42,615 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:43:42,615 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:43:42,615 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:43:42,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:43:42,654 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:43:44,537 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:43:44,537 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:43:44,537 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:43:44,538 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 03:43:45,009 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-04-13 03:43:45,009 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:43:45,041 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:43:45,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 03:43:45,056 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:43:45,059 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:43:45,059 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-13 03:43:46,521 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 03:43:46,525 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 03:43:46,525 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:43:46,527 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:43:46,531 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 03:43:46,531 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:34 [2018-04-13 03:43:46,880 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:43:46,881 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 03:43:46,881 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 82 [2018-04-13 03:43:46,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-04-13 03:43:46,881 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-04-13 03:43:46,882 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=6524, Unknown=0, NotChecked=0, Total=6806 [2018-04-13 03:43:46,882 INFO L87 Difference]: Start difference. First operand 300 states and 300 transitions. Second operand 83 states. [2018-04-13 03:43:53,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:43:53,349 INFO L93 Difference]: Finished difference Result 309 states and 309 transitions. [2018-04-13 03:43:53,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-04-13 03:43:53,349 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 292 [2018-04-13 03:43:53,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:43:53,350 INFO L225 Difference]: With dead ends: 309 [2018-04-13 03:43:53,350 INFO L226 Difference]: Without dead ends: 309 [2018-04-13 03:43:53,351 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 250 SyntacticMatches, 5 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6631 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=875, Invalid=23305, Unknown=0, NotChecked=0, Total=24180 [2018-04-13 03:43:53,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-04-13 03:43:53,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 308. [2018-04-13 03:43:53,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-04-13 03:43:53,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 308 transitions. [2018-04-13 03:43:53,353 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 308 transitions. Word has length 292 [2018-04-13 03:43:53,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:43:53,353 INFO L459 AbstractCegarLoop]: Abstraction has 308 states and 308 transitions. [2018-04-13 03:43:53,353 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-04-13 03:43:53,353 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 308 transitions. [2018-04-13 03:43:53,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-04-13 03:43:53,355 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:43:53,355 INFO L355 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:43:53,355 INFO L408 AbstractCegarLoop]: === Iteration 42 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolationMEMORY_LEAK]=== [2018-04-13 03:43:53,355 INFO L82 PathProgramCache]: Analyzing trace with hash -705304335, now seen corresponding path program 36 times [2018-04-13 03:43:53,355 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:43:53,355 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:43:53,356 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:43:53,356 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:43:53,356 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:43:53,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:43:53,423 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:43:55,603 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:43:55,604 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:43:55,604 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:43:55,604 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 03:43:56,304 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-04-13 03:43:56,304 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:43:56,320 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:43:56,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:43:56,331 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:43:56,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:43:56,333 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-13 03:43:57,594 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 03:43:57,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 03:43:57,596 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:43:57,597 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:43:57,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:43:57,602 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:43:57,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-13 03:43:57,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:43:57,653 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:43:57,654 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:43:57,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:43:57,659 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:43:57,719 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 03:43:57,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:43:57,721 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:43:57,722 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:43:57,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:43:57,726 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:43:57,774 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 03:43:57,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:43:57,775 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:43:57,776 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:43:57,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:43:57,781 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:43:57,827 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 03:43:57,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:43:57,829 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:43:57,830 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:43:57,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:43:57,834 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:43:57,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 03:43:57,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:43:57,896 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:43:57,897 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:43:57,902 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:43:57,902 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:43:57,948 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 03:43:57,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:43:57,950 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:43:57,951 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:43:57,956 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:43:57,956 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:43:58,074 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 03:43:58,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 03:43:58,086 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:43:58,088 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:43:58,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 03:43:58,095 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:48 [2018-04-13 03:43:58,441 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:43:58,441 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 03:43:58,441 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 43] total 84 [2018-04-13 03:43:58,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-04-13 03:43:58,442 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-04-13 03:43:58,442 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=6844, Unknown=0, NotChecked=0, Total=7140 [2018-04-13 03:43:58,442 INFO L87 Difference]: Start difference. First operand 308 states and 308 transitions. Second operand 85 states. [2018-04-13 03:44:07,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:44:07,943 INFO L93 Difference]: Finished difference Result 317 states and 317 transitions. [2018-04-13 03:44:07,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-04-13 03:44:07,944 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 300 [2018-04-13 03:44:07,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:44:07,945 INFO L225 Difference]: With dead ends: 317 [2018-04-13 03:44:07,945 INFO L226 Difference]: Without dead ends: 317 [2018-04-13 03:44:07,946 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 259 SyntacticMatches, 4 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6556 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=879, Invalid=23613, Unknown=0, NotChecked=0, Total=24492 [2018-04-13 03:44:07,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-04-13 03:44:07,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 316. [2018-04-13 03:44:07,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-04-13 03:44:07,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 316 transitions. [2018-04-13 03:44:07,951 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 316 transitions. Word has length 300 [2018-04-13 03:44:07,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:44:07,952 INFO L459 AbstractCegarLoop]: Abstraction has 316 states and 316 transitions. [2018-04-13 03:44:07,952 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-04-13 03:44:07,952 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 316 transitions. [2018-04-13 03:44:07,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-04-13 03:44:07,954 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:44:07,954 INFO L355 BasicCegarLoop]: trace histogram [38, 37, 37, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:44:07,954 INFO L408 AbstractCegarLoop]: === Iteration 43 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolationMEMORY_LEAK]=== [2018-04-13 03:44:07,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1163294176, now seen corresponding path program 37 times [2018-04-13 03:44:07,955 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:44:07,955 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:44:07,956 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:44:07,956 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:44:07,956 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:44:08,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:44:08,040 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:44:10,931 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:44:10,931 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:44:10,931 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:44:10,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:44:12,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:44:12,034 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:44:12,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:44:12,038 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:12,041 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:12,042 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-13 03:44:12,232 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 03:44:12,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:44:12,234 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:12,236 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:12,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:12,245 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:44:12,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:44:12,576 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 24 treesize of output 32 [2018-04-13 03:44:12,577 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:12,584 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:12,592 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:12,592 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:26 [2018-04-13 03:44:13,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:44:13,073 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 24 treesize of output 32 [2018-04-13 03:44:13,073 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:13,078 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:13,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:13,103 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:34 [2018-04-13 03:44:13,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:44:13,570 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 24 treesize of output 32 [2018-04-13 03:44:13,570 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:13,575 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:13,587 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:13,587 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:42 [2018-04-13 03:44:14,172 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:44:14,177 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 24 treesize of output 32 [2018-04-13 03:44:14,178 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:14,184 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:14,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:14,197 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:71, output treesize:50 [2018-04-13 03:44:14,465 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 03:44:14,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:44:14,468 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:14,470 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:14,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:14,486 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:62, output treesize:49 [2018-04-13 03:44:14,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:44:14,999 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 24 treesize of output 32 [2018-04-13 03:44:14,999 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:15,013 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:15,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:15,029 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:79, output treesize:58 [2018-04-13 03:44:15,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 03:44:15,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:44:15,285 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:15,287 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:15,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:15,303 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:70, output treesize:57 [2018-04-13 03:44:15,431 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 03:44:15,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:44:15,434 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:15,438 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:15,457 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:15,457 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:70, output treesize:57 [2018-04-13 03:44:15,584 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 03:44:15,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:44:15,588 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:15,590 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:15,605 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:15,605 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:70, output treesize:57 [2018-04-13 03:44:15,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-13 03:44:15,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:44:15,742 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:15,745 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:15,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:15,763 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:70, output treesize:57 [2018-04-13 03:44:15,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, 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 03:44:15,905 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:44:15,905 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:15,908 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:15,923 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:15,923 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:70, output treesize:57 [2018-04-13 03:44:16,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 03:44:16,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 03:44:16,100 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:16,104 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:16,128 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:16,129 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:70, output treesize:57 [2018-04-13 03:44:16,259 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 03:44:16,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:44:16,262 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:16,264 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:16,281 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:16,281 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:70, output treesize:57 [2018-04-13 03:44:16,428 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 03:44:16,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:44:16,432 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:16,434 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:16,451 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:16,451 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:70, output treesize:57 [2018-04-13 03:44:16,611 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 03:44:16,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, 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 03:44:16,614 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:16,617 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:16,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:16,636 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:70, output treesize:57 [2018-04-13 03:44:16,768 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 03:44:16,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:44:16,771 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:16,774 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:16,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:16,789 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:70, output treesize:57 [2018-04-13 03:44:16,882 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 03:44:16,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 10 treesize of output 9 [2018-04-13 03:44:16,885 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:16,886 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:16,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:16,897 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:70, output treesize:57 [2018-04-13 03:44:16,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-13 03:44:16,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:44:16,988 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:16,990 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:16,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:17,000 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:70, output treesize:57 [2018-04-13 03:44:17,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 03:44:17,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:44:17,077 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:17,078 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:17,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:17,089 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:70, output treesize:57 [2018-04-13 03:44:17,159 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 03:44:17,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:44:17,160 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:17,162 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:17,172 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:17,172 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:70, output treesize:57 [2018-04-13 03:44:17,245 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 03:44:17,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:44:17,256 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:17,260 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:17,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:17,278 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:70, output treesize:57 [2018-04-13 03:44:17,403 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 03:44:17,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:44:17,407 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:17,410 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:17,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:17,431 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:70, output treesize:57 [2018-04-13 03:44:17,557 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 03:44:17,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:44:17,560 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:17,563 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:17,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:17,581 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:70, output treesize:57 [2018-04-13 03:44:17,692 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 03:44:17,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:44:17,695 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:17,697 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:17,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:17,709 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:70, output treesize:57 [2018-04-13 03:44:17,840 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 03:44:17,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:44:17,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:17,846 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:17,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:17,874 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:70, output treesize:57 [2018-04-13 03:44:17,991 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 03:44:17,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:44:17,994 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:17,998 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:18,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:18,018 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:70, output treesize:57 [2018-04-13 03:44:18,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 13 treesize of output 10 [2018-04-13 03:44:18,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:44:18,173 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:18,176 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:18,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:18,188 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:70, output treesize:57 [2018-04-13 03:44:18,282 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 03:44:18,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:44:18,296 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:18,299 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:18,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:18,325 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:70, output treesize:57 [2018-04-13 03:44:18,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 03:44:18,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:44:18,417 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:18,418 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:18,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:18,430 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:70, output treesize:57 [2018-04-13 03:44:18,538 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 03:44:18,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:44:18,540 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:18,541 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:18,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:18,552 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:70, output treesize:57 [2018-04-13 03:44:18,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 03:44:18,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 03:44:18,642 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:18,643 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:18,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:18,655 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:70, output treesize:57 [2018-04-13 03:44:18,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-13 03:44:18,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 10 treesize of output 9 [2018-04-13 03:44:18,758 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:18,760 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:18,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:18,776 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:70, output treesize:57 [2018-04-13 03:44:18,977 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 03:44:18,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 03:44:18,982 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:44:18,984 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:44:18,988 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 03:44:18,989 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:48 [2018-04-13 03:44:19,567 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:44:19,567 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 03:44:19,568 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 64] total 105 [2018-04-13 03:44:19,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-04-13 03:44:19,568 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-04-13 03:44:19,568 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=408, Invalid=10722, Unknown=0, NotChecked=0, Total=11130 [2018-04-13 03:44:19,569 INFO L87 Difference]: Start difference. First operand 316 states and 316 transitions. Second operand 106 states. [2018-04-13 03:44:29,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:44:29,785 INFO L93 Difference]: Finished difference Result 325 states and 325 transitions. [2018-04-13 03:44:29,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-04-13 03:44:29,785 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 308 [2018-04-13 03:44:29,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:44:29,786 INFO L225 Difference]: With dead ends: 325 [2018-04-13 03:44:29,786 INFO L226 Difference]: Without dead ends: 325 [2018-04-13 03:44:29,787 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 246 SyntacticMatches, 4 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11635 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=1204, Invalid=37016, Unknown=0, NotChecked=0, Total=38220 [2018-04-13 03:44:29,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-04-13 03:44:29,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 324. [2018-04-13 03:44:29,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2018-04-13 03:44:29,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 324 transitions. [2018-04-13 03:44:29,790 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 324 transitions. Word has length 308 [2018-04-13 03:44:29,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:44:29,791 INFO L459 AbstractCegarLoop]: Abstraction has 324 states and 324 transitions. [2018-04-13 03:44:29,791 INFO L460 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-04-13 03:44:29,791 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 324 transitions. [2018-04-13 03:44:29,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2018-04-13 03:44:29,792 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:44:29,793 INFO L355 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:44:29,793 INFO L408 AbstractCegarLoop]: === Iteration 44 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolationMEMORY_LEAK]=== [2018-04-13 03:44:29,793 INFO L82 PathProgramCache]: Analyzing trace with hash 2126285903, now seen corresponding path program 38 times [2018-04-13 03:44:29,793 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:44:29,793 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:44:29,794 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:44:29,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:44:29,794 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:44:29,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:44:29,845 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:44:32,186 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:44:32,186 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:44:32,186 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:44:32,186 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 03:44:33,091 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 03:44:33,091 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:44:33,104 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:44:33,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:44:33,106 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:33,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:33,108 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-13 03:44:34,954 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 03:44:34,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 03:44:34,981 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:44:34,984 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:44:34,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 03:44:34,990 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:48 [2018-04-13 03:44:35,347 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:44:35,347 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 03:44:35,347 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 46] total 90 [2018-04-13 03:44:35,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-04-13 03:44:35,348 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-04-13 03:44:35,348 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=397, Invalid=7793, Unknown=0, NotChecked=0, Total=8190 [2018-04-13 03:44:35,348 INFO L87 Difference]: Start difference. First operand 324 states and 324 transitions. Second operand 91 states. [2018-04-13 03:44:42,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:44:42,561 INFO L93 Difference]: Finished difference Result 333 states and 333 transitions. [2018-04-13 03:44:42,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-04-13 03:44:42,561 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 316 [2018-04-13 03:44:42,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:44:42,562 INFO L225 Difference]: With dead ends: 333 [2018-04-13 03:44:42,562 INFO L226 Difference]: Without dead ends: 333 [2018-04-13 03:44:42,563 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 271 SyntacticMatches, 4 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7746 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=1109, Invalid=27283, Unknown=0, NotChecked=0, Total=28392 [2018-04-13 03:44:42,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-04-13 03:44:42,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 332. [2018-04-13 03:44:42,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2018-04-13 03:44:42,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 332 transitions. [2018-04-13 03:44:42,565 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 332 transitions. Word has length 316 [2018-04-13 03:44:42,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:44:42,565 INFO L459 AbstractCegarLoop]: Abstraction has 332 states and 332 transitions. [2018-04-13 03:44:42,565 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-04-13 03:44:42,565 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 332 transitions. [2018-04-13 03:44:42,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2018-04-13 03:44:42,566 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:44:42,566 INFO L355 BasicCegarLoop]: trace histogram [40, 39, 39, 39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:44:42,566 INFO L408 AbstractCegarLoop]: === Iteration 45 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolationMEMORY_LEAK]=== [2018-04-13 03:44:42,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1094578046, now seen corresponding path program 39 times [2018-04-13 03:44:42,567 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:44:42,567 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:44:42,567 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:44:42,567 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:44:42,567 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:44:42,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:44:42,619 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:44:44,889 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:44:44,889 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:44:44,890 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:44:44,890 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 03:44:45,229 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-04-13 03:44:45,229 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:44:45,245 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:44:45,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 03:44:45,248 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:45,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:45,249 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-13 03:44:46,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-13 03:44:46,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:44:46,861 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:46,862 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:46,866 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:46,867 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:44:46,923 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 03:44:46,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:44:46,924 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:46,925 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:46,929 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:46,929 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:44:46,995 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 03:44:46,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:44:46,996 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:44:46,998 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:47,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:44:47,002 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:44:47,109 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 03:44:47,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 03:44:47,113 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:44:47,115 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:44:47,119 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 03:44:47,120 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:34 [2018-04-13 03:44:47,542 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:44:47,542 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 03:44:47,542 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 90 [2018-04-13 03:44:47,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-04-13 03:44:47,543 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-04-13 03:44:47,543 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=7880, Unknown=0, NotChecked=0, Total=8190 [2018-04-13 03:44:47,543 INFO L87 Difference]: Start difference. First operand 332 states and 332 transitions. Second operand 91 states. [2018-04-13 03:44:55,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:44:55,765 INFO L93 Difference]: Finished difference Result 341 states and 341 transitions. [2018-04-13 03:44:55,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-04-13 03:44:55,765 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 324 [2018-04-13 03:44:55,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:44:55,766 INFO L225 Difference]: With dead ends: 341 [2018-04-13 03:44:55,766 INFO L226 Difference]: Without dead ends: 341 [2018-04-13 03:44:55,767 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 279 SyntacticMatches, 4 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8085 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=967, Invalid=28445, Unknown=0, NotChecked=0, Total=29412 [2018-04-13 03:44:55,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-04-13 03:44:55,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 340. [2018-04-13 03:44:55,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-04-13 03:44:55,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 340 transitions. [2018-04-13 03:44:55,768 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 340 transitions. Word has length 324 [2018-04-13 03:44:55,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:44:55,769 INFO L459 AbstractCegarLoop]: Abstraction has 340 states and 340 transitions. [2018-04-13 03:44:55,769 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-04-13 03:44:55,769 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 340 transitions. [2018-04-13 03:44:55,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2018-04-13 03:44:55,770 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:44:55,770 INFO L355 BasicCegarLoop]: trace histogram [41, 40, 40, 40, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:44:55,770 INFO L408 AbstractCegarLoop]: === Iteration 46 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolationMEMORY_LEAK]=== [2018-04-13 03:44:55,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1573080147, now seen corresponding path program 40 times [2018-04-13 03:44:55,770 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:44:55,770 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:44:55,771 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:44:55,771 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:44:55,771 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:44:55,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:44:55,835 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:44:58,291 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:44:58,292 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:44:58,292 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:44:58,292 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 03:45:00,155 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 03:45:00,156 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:45:00,176 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:45:00,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 03:45:00,178 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:45:00,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:45:00,181 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-13 03:45:02,431 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 03:45:02,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 03:45:02,436 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:45:02,438 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:45:02,444 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 03:45:02,444 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:48 [2018-04-13 03:45:02,890 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:45:02,890 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 03:45:02,890 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 47] total 92 [2018-04-13 03:45:02,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-04-13 03:45:02,891 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-04-13 03:45:02,891 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=8235, Unknown=0, NotChecked=0, Total=8556 [2018-04-13 03:45:02,891 INFO L87 Difference]: Start difference. First operand 340 states and 340 transitions. Second operand 93 states. [2018-04-13 03:45:11,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:45:11,782 INFO L93 Difference]: Finished difference Result 349 states and 349 transitions. [2018-04-13 03:45:11,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-04-13 03:45:11,782 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 332 [2018-04-13 03:45:11,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:45:11,783 INFO L225 Difference]: With dead ends: 349 [2018-04-13 03:45:11,783 INFO L226 Difference]: Without dead ends: 349 [2018-04-13 03:45:11,784 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 285 SyntacticMatches, 6 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7672 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=932, Invalid=27460, Unknown=0, NotChecked=0, Total=28392 [2018-04-13 03:45:11,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-04-13 03:45:11,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 348. [2018-04-13 03:45:11,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2018-04-13 03:45:11,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 348 transitions. [2018-04-13 03:45:11,786 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 348 transitions. Word has length 332 [2018-04-13 03:45:11,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:45:11,786 INFO L459 AbstractCegarLoop]: Abstraction has 348 states and 348 transitions. [2018-04-13 03:45:11,786 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-04-13 03:45:11,786 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 348 transitions. [2018-04-13 03:45:11,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2018-04-13 03:45:11,787 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:45:11,787 INFO L355 BasicCegarLoop]: trace histogram [42, 41, 41, 41, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:45:11,787 INFO L408 AbstractCegarLoop]: === Iteration 47 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolationMEMORY_LEAK]=== [2018-04-13 03:45:11,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1027090212, now seen corresponding path program 41 times [2018-04-13 03:45:11,787 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:45:11,788 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:45:11,788 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:45:11,788 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:45:11,788 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:45:11,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:45:11,852 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:45:14,403 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:45:14,403 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:45:14,403 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:45:14,404 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 03:45:17,512 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-04-13 03:45:17,512 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:45:17,547 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:45:17,549 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 03:45:17,549 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:45:17,550 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:45:17,551 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2018-04-13 03:45:20,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-04-13 03:45:20,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, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-04-13 03:45:20,163 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:45:20,165 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:45:20,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 03:45:20,170 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:57 [2018-04-13 03:45:20,694 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:45:20,694 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 03:45:20,694 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 51] total 99 [2018-04-13 03:45:20,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-04-13 03:45:20,695 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-04-13 03:45:20,695 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=423, Invalid=9477, Unknown=0, NotChecked=0, Total=9900 [2018-04-13 03:45:20,695 INFO L87 Difference]: Start difference. First operand 348 states and 348 transitions. Second operand 100 states. [2018-04-13 03:45:32,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:45:32,371 INFO L93 Difference]: Finished difference Result 357 states and 357 transitions. [2018-04-13 03:45:32,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-04-13 03:45:32,371 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 340 [2018-04-13 03:45:32,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:45:32,372 INFO L225 Difference]: With dead ends: 357 [2018-04-13 03:45:32,372 INFO L226 Difference]: Without dead ends: 357 [2018-04-13 03:45:32,373 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 291 SyntacticMatches, 1 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9023 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=1286, Invalid=32754, Unknown=0, NotChecked=0, Total=34040 [2018-04-13 03:45:32,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2018-04-13 03:45:32,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 356. [2018-04-13 03:45:32,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-04-13 03:45:32,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 356 transitions. [2018-04-13 03:45:32,375 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 356 transitions. Word has length 340 [2018-04-13 03:45:32,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:45:32,375 INFO L459 AbstractCegarLoop]: Abstraction has 356 states and 356 transitions. [2018-04-13 03:45:32,375 INFO L460 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-04-13 03:45:32,375 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 356 transitions. [2018-04-13 03:45:32,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2018-04-13 03:45:32,376 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:45:32,376 INFO L355 BasicCegarLoop]: trace histogram [43, 42, 42, 42, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:45:32,376 INFO L408 AbstractCegarLoop]: === Iteration 48 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolationMEMORY_LEAK]=== [2018-04-13 03:45:32,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1156472587, now seen corresponding path program 42 times [2018-04-13 03:45:32,377 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:45:32,377 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:45:32,377 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:45:32,377 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:45:32,377 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:45:32,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:45:32,446 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:45:34,954 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:45:34,954 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:45:34,954 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:45:34,955 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 03:45:35,685 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-04-13 03:45:35,685 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:45:35,701 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:45:35,707 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 03:45:35,707 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:45:35,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:45:35,709 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-13 03:45:37,556 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 03:45:37,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:45:37,558 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:45:37,559 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:45:37,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:45:37,564 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:45:37,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:45:37,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2018-04-13 03:45:37,805 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:45:37,807 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:45:37,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:45:37,813 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:26 [2018-04-13 03:45:38,028 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 03:45:38,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 03:45:38,032 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:45:38,034 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:45:38,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 03:45:38,039 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:48 [2018-04-13 03:45:38,438 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:45:38,439 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 03:45:38,439 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 53] total 100 [2018-04-13 03:45:38,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-04-13 03:45:38,439 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-04-13 03:45:38,440 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=361, Invalid=9739, Unknown=0, NotChecked=0, Total=10100 [2018-04-13 03:45:38,440 INFO L87 Difference]: Start difference. First operand 356 states and 356 transitions. Second operand 101 states. [2018-04-13 03:45:48,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:45:48,140 INFO L93 Difference]: Finished difference Result 365 states and 365 transitions. [2018-04-13 03:45:48,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-04-13 03:45:48,140 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 348 [2018-04-13 03:45:48,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:45:48,141 INFO L225 Difference]: With dead ends: 365 [2018-04-13 03:45:48,141 INFO L226 Difference]: Without dead ends: 365 [2018-04-13 03:45:48,142 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 489 GetRequests, 297 SyntacticMatches, 4 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10074 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=1099, Invalid=34811, Unknown=0, NotChecked=0, Total=35910 [2018-04-13 03:45:48,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-04-13 03:45:48,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 364. [2018-04-13 03:45:48,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-04-13 03:45:48,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 364 transitions. [2018-04-13 03:45:48,144 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 364 transitions. Word has length 348 [2018-04-13 03:45:48,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:45:48,144 INFO L459 AbstractCegarLoop]: Abstraction has 364 states and 364 transitions. [2018-04-13 03:45:48,144 INFO L460 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-04-13 03:45:48,145 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 364 transitions. [2018-04-13 03:45:48,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2018-04-13 03:45:48,146 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:45:48,146 INFO L355 BasicCegarLoop]: trace histogram [44, 43, 43, 43, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:45:48,146 INFO L408 AbstractCegarLoop]: === Iteration 49 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolationMEMORY_LEAK]=== [2018-04-13 03:45:48,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1270826554, now seen corresponding path program 43 times [2018-04-13 03:45:48,146 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:45:48,146 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:45:48,147 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:45:48,147 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:45:48,147 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:45:48,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:45:48,216 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:45:50,676 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:45:50,676 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:45:50,676 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:45:50,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:45:54,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:45:54,171 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:45:54,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:45:54,173 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:45:54,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:45:54,175 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-13 03:45:54,547 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 03:45:54,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:45:54,548 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:45:54,549 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:45:54,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:45:54,555 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:45:54,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:45:54,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 24 treesize of output 32 [2018-04-13 03:45:54,778 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:45:54,780 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:45:54,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:45:54,785 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:26 [2018-04-13 03:45:54,903 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 03:45:54,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:45:54,904 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:45:54,905 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:45:54,911 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:45:54,911 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:25 [2018-04-13 03:45:54,960 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 03:45:54,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:45:54,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:45:54,962 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:45:54,967 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:45:54,967 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:25 [2018-04-13 03:45:55,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:45:55,199 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 24 treesize of output 32 [2018-04-13 03:45:55,199 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:45:55,202 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:45:55,210 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:45:55,210 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:34 [2018-04-13 03:45:55,327 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 03:45:55,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:45:55,328 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:45:55,329 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:45:55,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:45:55,336 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:33 [2018-04-13 03:45:55,394 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 03:45:55,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:45:55,396 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:45:55,397 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:45:55,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:45:55,404 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:33 [2018-04-13 03:45:55,462 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 03:45:55,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:45:55,464 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:45:55,465 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:45:55,471 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:45:55,471 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:33 [2018-04-13 03:45:55,531 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 03:45:55,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:45:55,532 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:45:55,533 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:45:55,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:45:55,540 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:33 [2018-04-13 03:45:55,601 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 03:45:55,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:45:55,603 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:45:55,604 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:45:55,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:45:55,610 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:33 [2018-04-13 03:45:55,670 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 03:45:55,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:45:55,672 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:45:55,673 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:45:55,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:45:55,679 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:33 [2018-04-13 03:45:55,776 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 03:45:55,777 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:45:55,778 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:45:55,779 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:45:55,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:45:55,786 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:33 [2018-04-13 03:45:55,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-13 03:45:55,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:45:55,848 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:45:55,850 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:45:55,856 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:45:55,856 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:33 [2018-04-13 03:45:56,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:45:56,126 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 24 treesize of output 32 [2018-04-13 03:45:56,127 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:45:56,130 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:45:56,137 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:45:56,137 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:42 [2018-04-13 03:45:56,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, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:45:56,505 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 24 treesize of output 32 [2018-04-13 03:45:56,506 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:45:56,511 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:45:56,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:45:56,520 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:71, output treesize:50 [2018-04-13 03:45:56,668 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 03:45:56,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:45:56,669 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:45:56,670 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:45:56,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:45:56,679 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:62, output treesize:49 [2018-04-13 03:45:57,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:45:57,006 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 24 treesize of output 32 [2018-04-13 03:45:57,006 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:45:57,009 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:45:57,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:45:57,019 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:79, output treesize:58 [2018-04-13 03:45:57,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:45:57,453 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 24 treesize of output 32 [2018-04-13 03:45:57,453 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:45:57,456 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:45:57,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:45:57,476 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:87, output treesize:66 [2018-04-13 03:45:57,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:45:57,925 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 24 treesize of output 32 [2018-04-13 03:45:57,925 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:45:57,928 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:45:57,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:45:57,941 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:95, output treesize:74 [2018-04-13 03:45:58,130 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 03:45:58,132 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:45:58,132 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:45:58,134 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:45:58,148 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:45:58,148 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:86, output treesize:73 [2018-04-13 03:45:58,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-13 03:45:58,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:45:58,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:45:58,268 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:45:58,281 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:45:58,281 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:86, output treesize:73 [2018-04-13 03:45:58,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:45:58,699 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 24 treesize of output 32 [2018-04-13 03:45:58,699 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:45:58,703 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:45:58,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:45:58,718 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:103, output treesize:82 [2018-04-13 03:45:58,917 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 03:45:58,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:45:58,919 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:45:58,921 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:45:58,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:45:58,935 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:94, output treesize:81 [2018-04-13 03:45:59,053 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 03:45:59,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:45:59,055 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:45:59,056 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:45:59,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:45:59,070 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:94, output treesize:81 [2018-04-13 03:45:59,175 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 03:45:59,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:45:59,177 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:45:59,178 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:45:59,192 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:45:59,193 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:94, output treesize:81 [2018-04-13 03:45:59,295 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 03:45:59,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:45:59,297 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:45:59,298 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:45:59,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:45:59,313 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:94, output treesize:81 [2018-04-13 03:45:59,420 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 03:45:59,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 10 treesize of output 9 [2018-04-13 03:45:59,422 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:45:59,423 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:45:59,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:45:59,438 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:94, output treesize:81 [2018-04-13 03:45:59,545 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 03:45:59,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 10 treesize of output 9 [2018-04-13 03:45:59,547 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:45:59,549 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:45:59,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:45:59,571 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:94, output treesize:81 [2018-04-13 03:45:59,680 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 03:45:59,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 03:45:59,682 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:45:59,684 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:45:59,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:45:59,698 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:94, output treesize:81 [2018-04-13 03:45:59,803 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 03:45:59,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:45:59,805 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:45:59,807 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:45:59,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:45:59,821 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:94, output treesize:81 [2018-04-13 03:45:59,932 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 03:45:59,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:45:59,934 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:45:59,935 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:45:59,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:45:59,950 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:94, output treesize:81 [2018-04-13 03:46:00,073 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 03:46:00,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:46:00,075 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:46:00,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:46:00,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:46:00,090 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:94, output treesize:81 [2018-04-13 03:46:00,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 03:46:00,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:46:00,199 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:46:00,201 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:46:00,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:46:00,215 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:94, output treesize:81 [2018-04-13 03:46:00,334 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 03:46:00,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:46:00,335 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:46:00,336 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:46:00,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:46:00,350 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:94, output treesize:81 [2018-04-13 03:46:00,583 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 03:46:00,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 03:46:00,587 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:46:00,589 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:46:00,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 03:46:00,594 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:48 [2018-04-13 03:46:01,304 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:46:01,304 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 03:46:01,356 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 82] total 129 [2018-04-13 03:46:01,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-04-13 03:46:01,357 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-04-13 03:46:01,357 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=513, Invalid=16257, Unknown=0, NotChecked=0, Total=16770 [2018-04-13 03:46:01,357 INFO L87 Difference]: Start difference. First operand 364 states and 364 transitions. Second operand 130 states. [2018-04-13 03:46:14,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:46:14,489 INFO L93 Difference]: Finished difference Result 373 states and 373 transitions. [2018-04-13 03:46:14,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-04-13 03:46:14,489 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 356 [2018-04-13 03:46:14,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:46:14,490 INFO L225 Difference]: With dead ends: 373 [2018-04-13 03:46:14,490 INFO L226 Difference]: Without dead ends: 373 [2018-04-13 03:46:14,492 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 275 SyntacticMatches, 5 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17892 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=1492, Invalid=54914, Unknown=0, NotChecked=0, Total=56406 [2018-04-13 03:46:14,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2018-04-13 03:46:14,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 372. [2018-04-13 03:46:14,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2018-04-13 03:46:14,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 372 transitions. [2018-04-13 03:46:14,494 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 372 transitions. Word has length 356 [2018-04-13 03:46:14,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:46:14,495 INFO L459 AbstractCegarLoop]: Abstraction has 372 states and 372 transitions. [2018-04-13 03:46:14,495 INFO L460 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-04-13 03:46:14,495 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 372 transitions. [2018-04-13 03:46:14,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2018-04-13 03:46:14,496 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:46:14,496 INFO L355 BasicCegarLoop]: trace histogram [45, 44, 44, 44, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:46:14,496 INFO L408 AbstractCegarLoop]: === Iteration 50 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolationMEMORY_LEAK]=== [2018-04-13 03:46:14,496 INFO L82 PathProgramCache]: Analyzing trace with hash 2068418153, now seen corresponding path program 44 times [2018-04-13 03:46:14,496 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:46:14,496 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:46:14,497 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:46:14,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:46:14,497 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:46:14,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:46:14,623 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:46:17,353 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 7656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:46:17,353 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:46:17,353 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:46:17,353 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 03:46:18,274 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 03:46:18,274 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:46:18,290 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:46:18,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:46:18,292 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:46:18,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:46:18,301 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-13 03:46:20,535 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 03:46:20,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 03:46:20,539 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:46:20,541 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:46:20,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 03:46:20,546 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:48 [2018-04-13 03:46:21,024 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 7656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:46:21,024 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 03:46:21,025 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 51] total 100 [2018-04-13 03:46:21,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-04-13 03:46:21,025 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-04-13 03:46:21,025 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=9751, Unknown=0, NotChecked=0, Total=10100 [2018-04-13 03:46:21,025 INFO L87 Difference]: Start difference. First operand 372 states and 372 transitions. Second operand 101 states. [2018-04-13 03:46:29,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:46:29,111 INFO L93 Difference]: Finished difference Result 381 states and 381 transitions. [2018-04-13 03:46:29,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-04-13 03:46:29,112 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 364 [2018-04-13 03:46:29,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:46:29,113 INFO L225 Difference]: With dead ends: 381 [2018-04-13 03:46:29,113 INFO L226 Difference]: Without dead ends: 381 [2018-04-13 03:46:29,114 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 506 GetRequests, 313 SyntacticMatches, 6 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9756 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=1060, Invalid=34472, Unknown=0, NotChecked=0, Total=35532 [2018-04-13 03:46:29,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-04-13 03:46:29,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 380. [2018-04-13 03:46:29,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-04-13 03:46:29,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 380 transitions. [2018-04-13 03:46:29,117 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 380 transitions. Word has length 364 [2018-04-13 03:46:29,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:46:29,118 INFO L459 AbstractCegarLoop]: Abstraction has 380 states and 380 transitions. [2018-04-13 03:46:29,118 INFO L460 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-04-13 03:46:29,118 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 380 transitions. [2018-04-13 03:46:29,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2018-04-13 03:46:29,119 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:46:29,119 INFO L355 BasicCegarLoop]: trace histogram [46, 45, 45, 45, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:46:29,120 INFO L408 AbstractCegarLoop]: === Iteration 51 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolationMEMORY_LEAK]=== [2018-04-13 03:46:29,120 INFO L82 PathProgramCache]: Analyzing trace with hash -123979880, now seen corresponding path program 45 times [2018-04-13 03:46:29,120 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:46:29,120 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:46:29,120 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:46:29,120 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:46:29,121 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:46:29,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:46:29,188 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:46:31,946 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 8010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:46:31,946 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:46:31,946 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:46:31,946 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 03:46:32,158 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-04-13 03:46:32,158 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:46:32,170 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:46:32,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 03:46:32,171 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:46:32,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:46:32,174 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-13 03:46:34,443 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 03:46:34,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 03:46:34,448 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:46:34,451 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:46:34,456 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 03:46:34,456 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:34 [2018-04-13 03:46:35,005 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 8010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:46:35,006 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 03:46:35,006 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 102 [2018-04-13 03:46:35,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-04-13 03:46:35,006 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-04-13 03:46:35,006 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=10151, Unknown=0, NotChecked=0, Total=10506 [2018-04-13 03:46:35,007 INFO L87 Difference]: Start difference. First operand 380 states and 380 transitions. Second operand 103 states. [2018-04-13 03:46:44,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:46:44,588 INFO L93 Difference]: Finished difference Result 389 states and 389 transitions. [2018-04-13 03:46:44,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-04-13 03:46:44,588 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 372 [2018-04-13 03:46:44,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:46:44,589 INFO L225 Difference]: With dead ends: 389 [2018-04-13 03:46:44,589 INFO L226 Difference]: Without dead ends: 389 [2018-04-13 03:46:44,591 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 519 GetRequests, 321 SyntacticMatches, 4 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10419 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=1108, Invalid=37112, Unknown=0, NotChecked=0, Total=38220 [2018-04-13 03:46:44,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2018-04-13 03:46:44,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 388. [2018-04-13 03:46:44,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2018-04-13 03:46:44,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 388 transitions. [2018-04-13 03:46:44,593 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 388 transitions. Word has length 372 [2018-04-13 03:46:44,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:46:44,593 INFO L459 AbstractCegarLoop]: Abstraction has 388 states and 388 transitions. [2018-04-13 03:46:44,593 INFO L460 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-04-13 03:46:44,593 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 388 transitions. [2018-04-13 03:46:44,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2018-04-13 03:46:44,595 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:46:44,595 INFO L355 BasicCegarLoop]: trace histogram [47, 46, 46, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:46:44,595 INFO L408 AbstractCegarLoop]: === Iteration 52 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolationMEMORY_LEAK]=== [2018-04-13 03:46:44,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1774600647, now seen corresponding path program 46 times [2018-04-13 03:46:44,595 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:46:44,595 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:46:44,596 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:46:44,596 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:46:44,596 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:46:44,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:46:44,663 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:46:47,484 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 8372 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:46:47,485 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:46:47,485 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:46:47,485 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 03:46:48,997 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 03:46:48,997 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:46:49,020 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:46:49,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 03:46:49,028 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:46:49,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:46:49,030 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-13 03:46:50,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:46:50,619 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 24 treesize of output 32 [2018-04-13 03:46:50,619 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:46:50,622 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:46:50,627 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:46:50,627 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:26 [2018-04-13 03:46:50,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:46:50,980 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 24 treesize of output 32 [2018-04-13 03:46:50,980 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:46:50,983 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:46:50,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:46:50,990 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:34 [2018-04-13 03:46:51,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:46:51,359 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 24 treesize of output 32 [2018-04-13 03:46:51,360 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:46:51,362 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:46:51,370 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:46:51,370 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:42 [2018-04-13 03:46:51,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:46:51,763 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 24 treesize of output 32 [2018-04-13 03:46:51,764 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:46:51,767 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:46:51,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:46:51,776 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:71, output treesize:50 [2018-04-13 03:46:52,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:46:52,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 24 treesize of output 32 [2018-04-13 03:46:52,284 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:46:52,287 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:46:52,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:46:52,297 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:79, output treesize:58 [2018-04-13 03:46:52,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:46:52,738 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 24 treesize of output 32 [2018-04-13 03:46:52,738 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:46:52,741 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:46:52,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:46:52,752 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:87, output treesize:66 [2018-04-13 03:46:53,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:46:53,255 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 24 treesize of output 32 [2018-04-13 03:46:53,256 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:46:53,259 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:46:53,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:46:53,272 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:95, output treesize:74 [2018-04-13 03:46:53,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:46:53,830 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 24 treesize of output 32 [2018-04-13 03:46:53,830 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:46:53,833 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:46:53,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:46:53,847 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:103, output treesize:82 [2018-04-13 03:46:54,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:46:54,426 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 24 treesize of output 32 [2018-04-13 03:46:54,426 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:46:54,429 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:46:54,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:46:54,444 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:111, output treesize:90 [2018-04-13 03:46:55,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:46:55,038 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 24 treesize of output 32 [2018-04-13 03:46:55,038 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:46:55,041 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:46:55,059 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:46:55,059 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:119, output treesize:98 [2018-04-13 03:46:55,301 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 03:46:55,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:46:55,302 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:46:55,303 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:46:55,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:46:55,322 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:110, output treesize:97 [2018-04-13 03:46:55,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:46:55,846 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 24 treesize of output 32 [2018-04-13 03:46:55,846 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:46:55,856 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:46:55,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:46:55,874 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:127, output treesize:106 [2018-04-13 03:46:56,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:46:56,561 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 24 treesize of output 32 [2018-04-13 03:46:56,561 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:46:56,565 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:46:56,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:46:56,586 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:135, output treesize:114 [2018-04-13 03:46:57,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:46:57,315 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 24 treesize of output 32 [2018-04-13 03:46:57,316 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:46:57,319 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:46:57,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:46:57,342 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:143, output treesize:122 [2018-04-13 03:46:57,625 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 03:46:57,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:46:57,627 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:46:57,628 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:46:57,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:46:57,651 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:134, output treesize:121 [2018-04-13 03:46:58,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:46:58,281 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 24 treesize of output 32 [2018-04-13 03:46:58,281 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:46:58,284 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:46:58,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:46:58,308 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:151, output treesize:130 [2018-04-13 03:46:58,790 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 03:46:58,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, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 03:46:58,794 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:46:58,797 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:46:58,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 03:46:58,802 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:48 [2018-04-13 03:46:59,587 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 8372 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:46:59,588 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 03:46:59,588 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 109] total 160 [2018-04-13 03:46:59,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 161 states [2018-04-13 03:46:59,588 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 161 interpolants. [2018-04-13 03:46:59,589 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=678, Invalid=25082, Unknown=0, NotChecked=0, Total=25760 [2018-04-13 03:46:59,589 INFO L87 Difference]: Start difference. First operand 388 states and 388 transitions. Second operand 161 states. [2018-04-13 03:47:13,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:47:13,589 INFO L93 Difference]: Finished difference Result 397 states and 397 transitions. [2018-04-13 03:47:13,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2018-04-13 03:47:13,589 INFO L78 Accepts]: Start accepts. Automaton has 161 states. Word has length 380 [2018-04-13 03:47:13,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:47:13,590 INFO L225 Difference]: With dead ends: 397 [2018-04-13 03:47:13,590 INFO L226 Difference]: Without dead ends: 397 [2018-04-13 03:47:13,591 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 570 GetRequests, 273 SyntacticMatches, 4 SemanticMatches, 293 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29397 ImplicationChecksByTransitivity, 18.4s TimeCoverageRelationStatistics Valid=1956, Invalid=84774, Unknown=0, NotChecked=0, Total=86730 [2018-04-13 03:47:13,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2018-04-13 03:47:13,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 396. [2018-04-13 03:47:13,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-04-13 03:47:13,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 396 transitions. [2018-04-13 03:47:13,594 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 396 transitions. Word has length 380 [2018-04-13 03:47:13,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:47:13,594 INFO L459 AbstractCegarLoop]: Abstraction has 396 states and 396 transitions. [2018-04-13 03:47:13,594 INFO L460 AbstractCegarLoop]: Interpolant automaton has 161 states. [2018-04-13 03:47:13,594 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 396 transitions. [2018-04-13 03:47:13,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2018-04-13 03:47:13,595 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:47:13,595 INFO L355 BasicCegarLoop]: trace histogram [48, 47, 47, 47, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:47:13,595 INFO L408 AbstractCegarLoop]: === Iteration 53 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolationMEMORY_LEAK]=== [2018-04-13 03:47:13,595 INFO L82 PathProgramCache]: Analyzing trace with hash -170480394, now seen corresponding path program 47 times [2018-04-13 03:47:13,595 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:47:13,595 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:47:13,596 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:47:13,596 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:47:13,596 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:47:13,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:47:13,658 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:47:16,366 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 8742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:47:16,366 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:47:16,366 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:47:16,366 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 03:47:17,293 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-04-13 03:47:17,293 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:47:17,316 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:47:17,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 03:47:17,318 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:47:17,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:17,320 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-13 03:47:19,506 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 03:47:19,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:47:19,508 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:47:19,509 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:19,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:19,515 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:47:19,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-13 03:47:19,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:47:19,578 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:47:19,579 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:19,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:19,585 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:47:19,646 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 03:47:19,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:47:19,647 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:47:19,648 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:19,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:19,654 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:47:19,787 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 03:47:19,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 03:47:19,792 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:47:19,794 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:47:19,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 03:47:19,799 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:34 [2018-04-13 03:47:20,313 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 8742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:47:20,313 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 03:47:20,313 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 106 [2018-04-13 03:47:20,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-04-13 03:47:20,314 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-04-13 03:47:20,314 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=366, Invalid=10976, Unknown=0, NotChecked=0, Total=11342 [2018-04-13 03:47:20,314 INFO L87 Difference]: Start difference. First operand 396 states and 396 transitions. Second operand 107 states. [2018-04-13 03:47:29,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:47:29,661 INFO L93 Difference]: Finished difference Result 405 states and 405 transitions. [2018-04-13 03:47:29,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-04-13 03:47:29,662 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 388 [2018-04-13 03:47:29,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:47:29,662 INFO L225 Difference]: With dead ends: 405 [2018-04-13 03:47:29,662 INFO L226 Difference]: Without dead ends: 405 [2018-04-13 03:47:29,663 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 541 GetRequests, 334 SyntacticMatches, 5 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11433 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=1151, Invalid=40261, Unknown=0, NotChecked=0, Total=41412 [2018-04-13 03:47:29,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2018-04-13 03:47:29,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 404. [2018-04-13 03:47:29,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2018-04-13 03:47:29,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 404 transitions. [2018-04-13 03:47:29,665 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 404 transitions. Word has length 388 [2018-04-13 03:47:29,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:47:29,666 INFO L459 AbstractCegarLoop]: Abstraction has 404 states and 404 transitions. [2018-04-13 03:47:29,666 INFO L460 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-04-13 03:47:29,666 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 404 transitions. [2018-04-13 03:47:29,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2018-04-13 03:47:29,667 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:47:29,667 INFO L355 BasicCegarLoop]: trace histogram [49, 48, 48, 48, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:47:29,667 INFO L408 AbstractCegarLoop]: === Iteration 54 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolationMEMORY_LEAK]=== [2018-04-13 03:47:29,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1155299621, now seen corresponding path program 48 times [2018-04-13 03:47:29,667 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:47:29,667 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:47:29,668 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:47:29,668 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:47:29,668 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:47:29,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:47:29,736 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:47:32,758 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 9120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:47:32,759 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:47:32,759 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:47:32,759 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 03:47:35,922 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-04-13 03:47:35,922 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:47:35,938 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:47:35,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 03:47:35,940 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:47:35,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:35,942 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-13 03:47:36,408 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 03:47:36,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 03:47:36,409 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:47:36,410 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:36,414 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:36,414 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:47:36,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-13 03:47:36,470 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:47:36,470 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:47:36,471 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:36,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:36,475 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:47:36,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 03:47:36,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 10 treesize of output 9 [2018-04-13 03:47:36,533 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:47:36,534 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:36,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:36,539 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:47:36,592 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 03:47:36,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:47:36,593 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:47:36,594 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:36,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:36,599 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:47:36,647 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 03:47:36,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:47:36,649 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:47:36,650 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:36,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:36,654 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:47:36,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-13 03:47:36,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:47:36,710 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:47:36,722 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:36,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:36,727 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:47:36,786 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 03:47:36,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:47:36,787 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:47:36,788 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:36,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:36,793 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:47:36,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-13 03:47:36,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:47:36,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:47:36,846 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:36,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:36,850 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:47:36,903 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 03:47:36,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:47:36,904 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:47:36,905 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:36,910 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:36,910 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:47:36,964 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 03:47:36,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:47:36,965 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:47:36,966 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:36,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:36,971 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:47:37,023 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 03:47:37,025 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:47:37,025 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:47:37,027 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:37,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:37,031 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:47:37,085 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 03:47:37,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:47:37,086 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:47:37,087 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:37,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:37,091 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:47:37,144 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 03:47:37,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:47:37,146 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:47:37,147 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:37,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:37,151 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:47:37,201 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 03:47:37,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 03:47:37,202 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:47:37,207 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:37,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:37,212 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:47:37,262 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 03:47:37,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:47:37,264 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:47:37,265 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:37,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:37,269 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:47:37,327 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 03:47:37,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:47:37,329 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:47:37,330 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:37,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:37,334 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:47:37,388 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 03:47:37,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:47:37,389 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:47:37,390 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:37,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:37,395 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:47:37,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 03:47:37,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 03:47:37,449 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:47:37,450 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:37,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:37,455 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:47:37,508 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 03:47:37,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 03:47:37,510 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:47:37,511 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:37,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:37,516 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:47:37,572 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 03:47:37,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:47:37,573 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:47:37,574 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:37,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:37,578 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:47:37,630 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 03:47:37,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:47:37,632 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:47:37,633 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:37,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:37,637 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:47:37,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-13 03:47:37,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 03:47:37,692 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:47:37,694 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:37,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:37,698 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:47:37,764 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 03:47:37,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:47:37,765 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:47:37,766 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:37,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:37,770 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:47:37,824 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 03:47:37,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 10 treesize of output 9 [2018-04-13 03:47:37,825 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:47:37,826 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:37,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:37,831 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:47:37,889 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 03:47:37,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:47:37,890 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:47:37,891 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:37,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:37,896 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:47:37,955 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 03:47:37,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:47:37,956 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:47:37,957 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:37,962 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:37,962 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:47:38,021 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 03:47:38,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 10 treesize of output 9 [2018-04-13 03:47:38,023 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:47:38,024 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:38,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:38,029 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:47:38,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 03:47:38,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 03:47:38,088 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:47:38,089 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:38,094 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:38,094 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:47:38,160 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 03:47:38,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:47:38,161 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:47:38,163 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:38,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:38,168 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:47:38,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-13 03:47:38,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:47:38,230 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:47:38,231 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:38,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:38,236 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:47:38,294 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 03:47:38,295 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:47:38,296 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:47:38,297 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:38,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:38,310 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:47:38,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 03:47:38,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:47:38,377 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:47:38,379 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:38,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:38,384 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:47:38,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-13 03:47:38,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:47:38,453 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:47:38,454 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:38,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:38,459 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:47:38,521 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 03:47:38,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:47:38,522 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:47:38,524 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:38,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:38,529 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:47:38,590 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 03:47:38,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:47:38,591 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:47:38,593 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:38,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:38,597 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:47:38,660 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 03:47:38,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:47:38,661 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:47:38,679 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:38,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:38,684 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:47:38,750 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 03:47:38,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:47:38,751 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:47:38,752 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:38,757 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:38,757 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:47:38,895 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 03:47:38,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, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 03:47:38,899 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:47:38,901 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:47:38,906 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 03:47:38,906 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:48 [2018-04-13 03:47:39,415 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 9120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:47:39,415 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 03:47:39,415 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 55] total 108 [2018-04-13 03:47:39,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-04-13 03:47:39,416 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-04-13 03:47:39,416 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=377, Invalid=11395, Unknown=0, NotChecked=0, Total=11772 [2018-04-13 03:47:39,417 INFO L87 Difference]: Start difference. First operand 404 states and 404 transitions. Second operand 109 states. [2018-04-13 03:47:47,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:47:47,890 INFO L93 Difference]: Finished difference Result 413 states and 413 transitions. [2018-04-13 03:47:47,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-04-13 03:47:47,890 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 396 [2018-04-13 03:47:47,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:47:47,891 INFO L225 Difference]: With dead ends: 413 [2018-04-13 03:47:47,891 INFO L226 Difference]: Without dead ends: 413 [2018-04-13 03:47:47,892 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 538 GetRequests, 343 SyntacticMatches, 4 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9797 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=1044, Invalid=36012, Unknown=0, NotChecked=0, Total=37056 [2018-04-13 03:47:47,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2018-04-13 03:47:47,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 412. [2018-04-13 03:47:47,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2018-04-13 03:47:47,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 412 transitions. [2018-04-13 03:47:47,894 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 412 transitions. Word has length 396 [2018-04-13 03:47:47,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:47:47,894 INFO L459 AbstractCegarLoop]: Abstraction has 412 states and 412 transitions. [2018-04-13 03:47:47,894 INFO L460 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-04-13 03:47:47,894 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 412 transitions. [2018-04-13 03:47:47,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2018-04-13 03:47:47,895 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:47:47,895 INFO L355 BasicCegarLoop]: trace histogram [50, 49, 49, 49, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:47:47,895 INFO L408 AbstractCegarLoop]: === Iteration 55 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolationMEMORY_LEAK]=== [2018-04-13 03:47:47,896 INFO L82 PathProgramCache]: Analyzing trace with hash 2145822292, now seen corresponding path program 49 times [2018-04-13 03:47:47,896 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:47:47,896 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:47:47,896 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:47:47,896 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:47:47,896 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:47:47,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:47:47,965 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:47:51,013 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 9506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:47:51,013 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:47:51,013 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:47:51,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:47:54,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:47:54,192 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:47:54,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 03:47:54,194 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:47:54,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:47:54,196 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-13 03:47:56,835 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 03:47:56,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 03:47:56,838 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:47:56,840 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:47:56,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 03:47:56,845 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:48 [2018-04-13 03:47:57,337 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 9506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:47:57,338 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 03:47:57,338 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 111 [2018-04-13 03:47:57,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-04-13 03:47:57,339 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-04-13 03:47:57,339 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=490, Invalid=11942, Unknown=0, NotChecked=0, Total=12432 [2018-04-13 03:47:57,339 INFO L87 Difference]: Start difference. First operand 412 states and 412 transitions. Second operand 112 states. [2018-04-13 03:48:08,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:48:08,209 INFO L93 Difference]: Finished difference Result 421 states and 421 transitions. [2018-04-13 03:48:08,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-04-13 03:48:08,209 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 404 [2018-04-13 03:48:08,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:48:08,210 INFO L225 Difference]: With dead ends: 421 [2018-04-13 03:48:08,210 INFO L226 Difference]: Without dead ends: 421 [2018-04-13 03:48:08,211 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 563 GetRequests, 349 SyntacticMatches, 3 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12338 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=1408, Invalid=43748, Unknown=0, NotChecked=0, Total=45156 [2018-04-13 03:48:08,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2018-04-13 03:48:08,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 420. [2018-04-13 03:48:08,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2018-04-13 03:48:08,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 420 transitions. [2018-04-13 03:48:08,214 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 420 transitions. Word has length 404 [2018-04-13 03:48:08,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:48:08,214 INFO L459 AbstractCegarLoop]: Abstraction has 420 states and 420 transitions. [2018-04-13 03:48:08,214 INFO L460 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-04-13 03:48:08,214 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 420 transitions. [2018-04-13 03:48:08,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2018-04-13 03:48:08,215 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:48:08,215 INFO L355 BasicCegarLoop]: trace histogram [51, 50, 50, 50, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:48:08,215 INFO L408 AbstractCegarLoop]: === Iteration 56 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolationMEMORY_LEAK]=== [2018-04-13 03:48:08,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1359230083, now seen corresponding path program 50 times [2018-04-13 03:48:08,215 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:48:08,215 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:48:08,216 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:48:08,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:48:08,216 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:48:08,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:48:08,289 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:48:11,508 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 9900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:48:11,508 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:48:11,508 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:48:11,509 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 03:48:14,218 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 03:48:14,219 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:48:14,244 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:48:14,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:48:14,246 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:48:14,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:14,248 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-13 03:48:14,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:48:14,524 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 24 treesize of output 32 [2018-04-13 03:48:14,525 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:48:14,528 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:14,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:14,539 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:26 [2018-04-13 03:48:14,646 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 03:48:14,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:48:14,647 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:48:14,648 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:14,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:14,654 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:25 [2018-04-13 03:48:14,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:48:14,905 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 24 treesize of output 32 [2018-04-13 03:48:14,905 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:48:14,909 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:14,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:14,917 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:34 [2018-04-13 03:48:15,041 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 03:48:15,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:48:15,042 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:48:15,043 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:15,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:15,050 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:33 [2018-04-13 03:48:15,114 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 03:48:15,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:48:15,116 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:48:15,117 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:15,123 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:15,123 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:33 [2018-04-13 03:48:15,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:48:15,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2018-04-13 03:48:15,397 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:48:15,400 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:15,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:15,408 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:42 [2018-04-13 03:48:15,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:48:15,760 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 24 treesize of output 32 [2018-04-13 03:48:15,760 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:48:15,763 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:15,772 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:15,772 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:71, output treesize:50 [2018-04-13 03:48:16,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:48:16,168 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 24 treesize of output 32 [2018-04-13 03:48:16,168 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:48:16,171 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:16,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:16,181 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:79, output treesize:58 [2018-04-13 03:48:16,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:48:16,595 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 24 treesize of output 32 [2018-04-13 03:48:16,595 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:48:16,598 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:16,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:16,610 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:87, output treesize:66 [2018-04-13 03:48:17,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:48:17,070 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 24 treesize of output 32 [2018-04-13 03:48:17,070 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:48:17,074 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:17,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:17,090 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:95, output treesize:74 [2018-04-13 03:48:17,268 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 03:48:17,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:48:17,269 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:48:17,271 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:17,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:17,284 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:86, output treesize:73 [2018-04-13 03:48:17,379 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 03:48:17,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:48:17,380 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:48:17,382 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:17,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:17,394 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:86, output treesize:73 [2018-04-13 03:48:17,486 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 03:48:17,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, 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 03:48:17,487 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:48:17,489 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:17,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:17,502 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:86, output treesize:73 [2018-04-13 03:48:17,596 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 03:48:17,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:48:17,598 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:48:17,600 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:17,613 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:17,614 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:86, output treesize:73 [2018-04-13 03:48:17,710 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 03:48:17,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:48:17,711 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:48:17,713 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:17,724 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:17,725 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:86, output treesize:73 [2018-04-13 03:48:17,820 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 03:48:17,822 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:48:17,822 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:48:17,824 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:17,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:17,837 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:86, output treesize:73 [2018-04-13 03:48:17,931 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 03:48:17,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:48:17,933 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:48:17,934 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:17,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:17,947 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:86, output treesize:73 [2018-04-13 03:48:18,049 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 03:48:18,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:48:18,050 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:48:18,052 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:18,069 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:18,069 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:86, output treesize:73 [2018-04-13 03:48:18,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-13 03:48:18,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:48:18,193 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:48:18,194 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:18,207 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:18,207 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:86, output treesize:73 [2018-04-13 03:48:18,302 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 03:48:18,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:48:18,304 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:48:18,307 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:18,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:18,320 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:86, output treesize:73 [2018-04-13 03:48:18,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 03:48:18,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:48:18,432 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:48:18,433 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:18,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:18,446 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:86, output treesize:73 [2018-04-13 03:48:18,543 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 03:48:18,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:48:18,545 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:48:18,546 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:18,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:18,559 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:86, output treesize:73 [2018-04-13 03:48:18,658 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 03:48:18,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:48:18,660 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:48:18,662 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:18,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:18,675 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:86, output treesize:73 [2018-04-13 03:48:18,781 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 03:48:18,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:48:18,783 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:48:18,785 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:18,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:18,797 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:86, output treesize:73 [2018-04-13 03:48:18,894 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 03:48:18,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:48:18,896 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:48:18,897 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:18,910 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:18,910 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:86, output treesize:73 [2018-04-13 03:48:19,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, 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 03:48:19,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 03:48:19,013 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:48:19,014 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:19,027 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:19,027 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:86, output treesize:73 [2018-04-13 03:48:19,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, 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 03:48:19,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:48:19,131 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:48:19,132 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:19,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:19,145 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:86, output treesize:73 [2018-04-13 03:48:19,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:48:19,656 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 24 treesize of output 32 [2018-04-13 03:48:19,656 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:48:19,659 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:19,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:19,674 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:103, output treesize:82 [2018-04-13 03:48:19,905 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 03:48:19,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 10 treesize of output 9 [2018-04-13 03:48:19,907 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:48:19,908 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:19,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:19,922 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:94, output treesize:81 [2018-04-13 03:48:20,032 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 03:48:20,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:48:20,033 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:48:20,034 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:20,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:20,048 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:94, output treesize:81 [2018-04-13 03:48:20,157 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 03:48:20,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:48:20,159 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:48:20,160 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:20,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:20,174 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:94, output treesize:81 [2018-04-13 03:48:20,284 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 03:48:20,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:48:20,285 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:48:20,287 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:20,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:20,301 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:94, output treesize:81 [2018-04-13 03:48:20,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:48:20,783 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 24 treesize of output 32 [2018-04-13 03:48:20,784 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:48:20,787 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:20,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:20,803 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:111, output treesize:90 [2018-04-13 03:48:21,045 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 03:48:21,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:48:21,047 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:48:21,049 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:21,065 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:21,065 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:102, output treesize:89 [2018-04-13 03:48:21,186 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 03:48:21,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:48:21,188 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:48:21,189 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:21,203 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:21,204 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:102, output treesize:89 [2018-04-13 03:48:21,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:48:21,728 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 24 treesize of output 32 [2018-04-13 03:48:21,728 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:48:21,732 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:21,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:21,748 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:119, output treesize:98 [2018-04-13 03:48:22,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:48:22,414 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 24 treesize of output 32 [2018-04-13 03:48:22,415 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:48:22,418 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:22,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:22,436 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:127, output treesize:106 [2018-04-13 03:48:23,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:48:23,129 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 24 treesize of output 32 [2018-04-13 03:48:23,129 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:48:23,133 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:23,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:23,153 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:135, output treesize:114 [2018-04-13 03:48:23,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-13 03:48:23,438 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:48:23,439 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:48:23,440 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:23,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:23,461 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:126, output treesize:113 [2018-04-13 03:48:24,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:48:24,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2018-04-13 03:48:24,088 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:48:24,091 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:24,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:24,115 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:143, output treesize:122 [2018-04-13 03:48:24,916 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:48:24,919 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 24 treesize of output 32 [2018-04-13 03:48:24,932 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:48:24,935 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:24,958 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:24,958 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:151, output treesize:130 [2018-04-13 03:48:25,439 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 03:48:25,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 03:48:25,440 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:48:25,441 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:25,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:25,447 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:24 [2018-04-13 03:48:25,556 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 03:48:25,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:48:25,557 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:48:25,558 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:25,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:25,563 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:22 [2018-04-13 03:48:25,660 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 03:48:25,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:48:25,661 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:48:25,663 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:25,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:25,668 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:22 [2018-04-13 03:48:25,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-13 03:48:25,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:48:25,771 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:48:25,772 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:25,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:25,778 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:22 [2018-04-13 03:48:25,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-13 03:48:25,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:48:25,988 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:48:25,990 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:25,995 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:25,995 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:24 [2018-04-13 03:48:26,210 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 03:48:26,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 03:48:26,212 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:48:26,213 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:26,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:26,221 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:22 [2018-04-13 03:48:26,562 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 03:48:26,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 03:48:26,566 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:48:26,569 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:48:26,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 03:48:26,573 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:48 [2018-04-13 03:48:27,673 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 9900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:48:27,673 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 03:48:27,674 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 115] total 170 [2018-04-13 03:48:27,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 171 states [2018-04-13 03:48:27,674 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 171 interpolants. [2018-04-13 03:48:27,675 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=711, Invalid=28359, Unknown=0, NotChecked=0, Total=29070 [2018-04-13 03:48:27,675 INFO L87 Difference]: Start difference. First operand 420 states and 420 transitions. Second operand 171 states. [2018-04-13 03:48:43,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:48:43,296 INFO L93 Difference]: Finished difference Result 429 states and 429 transitions. [2018-04-13 03:48:43,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2018-04-13 03:48:43,296 INFO L78 Accepts]: Start accepts. Automaton has 171 states. Word has length 412 [2018-04-13 03:48:43,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:48:43,297 INFO L225 Difference]: With dead ends: 429 [2018-04-13 03:48:43,297 INFO L226 Difference]: Without dead ends: 429 [2018-04-13 03:48:43,298 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 609 GetRequests, 297 SyntacticMatches, 6 SemanticMatches, 306 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32187 ImplicationChecksByTransitivity, 21.7s TimeCoverageRelationStatistics Valid=2007, Invalid=92549, Unknown=0, NotChecked=0, Total=94556 [2018-04-13 03:48:43,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2018-04-13 03:48:43,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 428. [2018-04-13 03:48:43,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-04-13 03:48:43,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 428 transitions. [2018-04-13 03:48:43,300 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 428 transitions. Word has length 412 [2018-04-13 03:48:43,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:48:43,301 INFO L459 AbstractCegarLoop]: Abstraction has 428 states and 428 transitions. [2018-04-13 03:48:43,301 INFO L460 AbstractCegarLoop]: Interpolant automaton has 171 states. [2018-04-13 03:48:43,301 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 428 transitions. [2018-04-13 03:48:43,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2018-04-13 03:48:43,302 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:48:43,302 INFO L355 BasicCegarLoop]: trace histogram [52, 51, 51, 51, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:48:43,302 INFO L408 AbstractCegarLoop]: === Iteration 57 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolationMEMORY_LEAK]=== [2018-04-13 03:48:43,302 INFO L82 PathProgramCache]: Analyzing trace with hash -482073678, now seen corresponding path program 51 times [2018-04-13 03:48:43,302 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:48:43,302 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:48:43,303 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:48:43,303 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:48:43,303 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:48:43,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:48:43,375 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:48:46,514 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 10302 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:48:46,515 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:48:46,515 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:48:46,515 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 03:48:48,376 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-04-13 03:48:48,376 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:48:48,428 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:48:48,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 03:48:48,430 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:48:48,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:48,432 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-13 03:48:50,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 03:48:50,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:48:50,707 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:48:50,708 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:50,712 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:50,712 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:48:50,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-13 03:48:50,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 10 treesize of output 9 [2018-04-13 03:48:50,773 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:48:50,774 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:50,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:50,779 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:48:50,842 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 03:48:50,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:48:50,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:48:50,844 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:50,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:50,849 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:48:50,912 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 03:48:50,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:48:50,914 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:48:50,915 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:50,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:50,919 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:48:50,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 03:48:50,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:48:50,982 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:48:50,983 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:50,988 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:50,988 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:48:51,051 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 03:48:51,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 10 treesize of output 9 [2018-04-13 03:48:51,053 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:48:51,054 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:51,059 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:51,059 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:48:51,123 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 03:48:51,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:48:51,125 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:48:51,126 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:51,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:48:51,130 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:48:51,267 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 03:48:51,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 03:48:51,271 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:48:51,273 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:48:51,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 03:48:51,278 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:34 [2018-04-13 03:48:51,885 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 10302 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:48:51,886 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 03:48:51,886 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 114 [2018-04-13 03:48:51,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-04-13 03:48:51,886 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-04-13 03:48:51,887 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=394, Invalid=12716, Unknown=0, NotChecked=0, Total=13110 [2018-04-13 03:48:51,887 INFO L87 Difference]: Start difference. First operand 428 states and 428 transitions. Second operand 115 states. [2018-04-13 03:49:02,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:49:02,640 INFO L93 Difference]: Finished difference Result 437 states and 437 transitions. [2018-04-13 03:49:02,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-04-13 03:49:02,640 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 420 [2018-04-13 03:49:02,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:49:02,641 INFO L225 Difference]: With dead ends: 437 [2018-04-13 03:49:02,641 INFO L226 Difference]: Without dead ends: 437 [2018-04-13 03:49:02,642 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 585 GetRequests, 363 SyntacticMatches, 4 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13323 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=1243, Invalid=46937, Unknown=0, NotChecked=0, Total=48180 [2018-04-13 03:49:02,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2018-04-13 03:49:02,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 436. [2018-04-13 03:49:02,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2018-04-13 03:49:02,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 436 transitions. [2018-04-13 03:49:02,645 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 436 transitions. Word has length 420 [2018-04-13 03:49:02,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:49:02,645 INFO L459 AbstractCegarLoop]: Abstraction has 436 states and 436 transitions. [2018-04-13 03:49:02,645 INFO L460 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-04-13 03:49:02,645 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 436 transitions. [2018-04-13 03:49:02,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2018-04-13 03:49:02,646 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:49:02,646 INFO L355 BasicCegarLoop]: trace histogram [53, 52, 52, 52, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:49:02,646 INFO L408 AbstractCegarLoop]: === Iteration 58 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolationMEMORY_LEAK]=== [2018-04-13 03:49:02,646 INFO L82 PathProgramCache]: Analyzing trace with hash -491424799, now seen corresponding path program 52 times [2018-04-13 03:49:02,646 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:49:02,646 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:49:02,647 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:49:02,647 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:49:02,647 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:49:02,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:49:02,726 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:49:05,989 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 10712 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:49:05,989 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:49:05,989 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:49:05,990 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 03:49:13,241 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 03:49:13,241 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:49:13,280 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:49:13,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 03:49:13,282 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:49:13,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:49:13,284 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-13 03:49:16,282 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 03:49:16,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 03:49:16,286 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:49:16,288 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:49:16,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 03:49:16,293 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:48 [2018-04-13 03:49:16,866 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 10712 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:49:16,866 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 03:49:16,866 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 59] total 116 [2018-04-13 03:49:16,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-04-13 03:49:16,867 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-04-13 03:49:16,867 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=405, Invalid=13167, Unknown=0, NotChecked=0, Total=13572 [2018-04-13 03:49:16,867 INFO L87 Difference]: Start difference. First operand 436 states and 436 transitions. Second operand 117 states. [2018-04-13 03:49:30,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:49:30,611 INFO L93 Difference]: Finished difference Result 445 states and 445 transitions. [2018-04-13 03:49:30,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-04-13 03:49:30,611 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 428 [2018-04-13 03:49:30,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:49:30,612 INFO L225 Difference]: With dead ends: 445 [2018-04-13 03:49:30,612 INFO L226 Difference]: Without dead ends: 445 [2018-04-13 03:49:30,613 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 594 GetRequests, 370 SyntacticMatches, 5 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13400 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=1244, Invalid=47376, Unknown=0, NotChecked=0, Total=48620 [2018-04-13 03:49:30,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2018-04-13 03:49:30,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 444. [2018-04-13 03:49:30,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2018-04-13 03:49:30,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 444 transitions. [2018-04-13 03:49:30,615 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 444 transitions. Word has length 428 [2018-04-13 03:49:30,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:49:30,615 INFO L459 AbstractCegarLoop]: Abstraction has 444 states and 444 transitions. [2018-04-13 03:49:30,616 INFO L460 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-04-13 03:49:30,616 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 444 transitions. [2018-04-13 03:49:30,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2018-04-13 03:49:30,617 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:49:30,617 INFO L355 BasicCegarLoop]: trace histogram [54, 53, 53, 53, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:49:30,617 INFO L408 AbstractCegarLoop]: === Iteration 59 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolationMEMORY_LEAK]=== [2018-04-13 03:49:30,617 INFO L82 PathProgramCache]: Analyzing trace with hash 2087134480, now seen corresponding path program 53 times [2018-04-13 03:49:30,617 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:49:30,617 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:49:30,618 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:49:30,618 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:49:30,618 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:49:30,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:49:30,698 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:49:33,984 INFO L134 CoverageAnalysis]: Checked inductivity of 11130 backedges. 0 proven. 11130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:49:33,984 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:49:33,984 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:49:33,985 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 03:49:35,646 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2018-04-13 03:49:35,646 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:49:35,661 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:49:35,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 8 treesize of output 7 [2018-04-13 03:49:35,663 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:49:35,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:49:35,665 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-13 03:49:38,710 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 03:49:38,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 03:49:38,714 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:49:38,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:49:38,720 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 03:49:38,720 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:34 [2018-04-13 03:49:39,336 INFO L134 CoverageAnalysis]: Checked inductivity of 11130 backedges. 0 proven. 11130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:49:39,336 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 03:49:39,336 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 118 [2018-04-13 03:49:39,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-04-13 03:49:39,337 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-04-13 03:49:39,337 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=408, Invalid=13634, Unknown=0, NotChecked=0, Total=14042 [2018-04-13 03:49:39,337 INFO L87 Difference]: Start difference. First operand 444 states and 444 transitions. Second operand 119 states. [2018-04-13 03:49:52,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:49:52,144 INFO L93 Difference]: Finished difference Result 453 states and 453 transitions. [2018-04-13 03:49:52,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-04-13 03:49:52,144 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 436 [2018-04-13 03:49:52,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:49:52,145 INFO L225 Difference]: With dead ends: 453 [2018-04-13 03:49:52,145 INFO L226 Difference]: Without dead ends: 453 [2018-04-13 03:49:52,146 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 607 GetRequests, 377 SyntacticMatches, 4 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14322 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=1289, Invalid=50467, Unknown=0, NotChecked=0, Total=51756 [2018-04-13 03:49:52,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2018-04-13 03:49:52,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 452. [2018-04-13 03:49:52,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2018-04-13 03:49:52,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 452 transitions. [2018-04-13 03:49:52,148 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 452 transitions. Word has length 436 [2018-04-13 03:49:52,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:49:52,149 INFO L459 AbstractCegarLoop]: Abstraction has 452 states and 452 transitions. [2018-04-13 03:49:52,149 INFO L460 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-04-13 03:49:52,149 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 452 transitions. [2018-04-13 03:49:52,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2018-04-13 03:49:52,150 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:49:52,150 INFO L355 BasicCegarLoop]: trace histogram [55, 54, 54, 54, 54, 54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:49:52,150 INFO L408 AbstractCegarLoop]: === Iteration 60 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolationMEMORY_LEAK]=== [2018-04-13 03:49:52,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1583888191, now seen corresponding path program 54 times [2018-04-13 03:49:52,150 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:49:52,150 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:49:52,151 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:49:52,151 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:49:52,151 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:49:52,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:49:52,234 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:49:55,729 INFO L134 CoverageAnalysis]: Checked inductivity of 11556 backedges. 0 proven. 11556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:49:55,729 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:49:55,729 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:49:55,730 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 03:49:56,222 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2018-04-13 03:49:56,222 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:49:56,241 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:49:56,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 03:49:56,243 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:49:56,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:49:56,245 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-13 03:49:59,225 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 03:49:59,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:49:59,226 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:49:59,228 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:49:59,232 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:49:59,232 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:49:59,300 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 03:49:59,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:49:59,301 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:49:59,302 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:49:59,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:49:59,312 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:49:59,475 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 03:49:59,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 03:49:59,479 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:49:59,481 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:49:59,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 03:49:59,486 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:48 [2018-04-13 03:50:00,090 INFO L134 CoverageAnalysis]: Checked inductivity of 11556 backedges. 0 proven. 11556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:50:00,090 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 03:50:00,090 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 61] total 120 [2018-04-13 03:50:00,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-04-13 03:50:00,091 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-04-13 03:50:00,091 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=14101, Unknown=0, NotChecked=0, Total=14520 [2018-04-13 03:50:00,091 INFO L87 Difference]: Start difference. First operand 452 states and 452 transitions. Second operand 121 states. [2018-04-13 03:50:13,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:50:13,621 INFO L93 Difference]: Finished difference Result 461 states and 461 transitions. [2018-04-13 03:50:13,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-04-13 03:50:13,621 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 444 [2018-04-13 03:50:13,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:50:13,623 INFO L225 Difference]: With dead ends: 461 [2018-04-13 03:50:13,623 INFO L226 Difference]: Without dead ends: 461 [2018-04-13 03:50:13,624 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 618 GetRequests, 385 SyntacticMatches, 4 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14675 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=1308, Invalid=51822, Unknown=0, NotChecked=0, Total=53130 [2018-04-13 03:50:13,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2018-04-13 03:50:13,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 460. [2018-04-13 03:50:13,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-04-13 03:50:13,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 460 transitions. [2018-04-13 03:50:13,627 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 460 transitions. Word has length 444 [2018-04-13 03:50:13,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:50:13,627 INFO L459 AbstractCegarLoop]: Abstraction has 460 states and 460 transitions. [2018-04-13 03:50:13,627 INFO L460 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-04-13 03:50:13,627 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 460 transitions. [2018-04-13 03:50:13,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2018-04-13 03:50:13,628 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:50:13,628 INFO L355 BasicCegarLoop]: trace histogram [56, 55, 55, 55, 55, 55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:50:13,629 INFO L408 AbstractCegarLoop]: === Iteration 61 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolationMEMORY_LEAK]=== [2018-04-13 03:50:13,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1211651474, now seen corresponding path program 55 times [2018-04-13 03:50:13,629 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:50:13,629 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:50:13,629 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:50:13,629 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:50:13,629 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:50:13,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:50:13,731 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:50:17,369 INFO L134 CoverageAnalysis]: Checked inductivity of 11990 backedges. 0 proven. 11990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:50:17,369 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:50:17,369 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:50:17,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:50:19,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:50:19,378 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:50:19,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 03:50:19,380 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:50:19,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:50:19,382 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-13 03:50:22,608 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 03:50:22,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 03:50:22,612 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:50:22,614 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:50:22,619 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 03:50:22,619 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:48 [2018-04-13 03:50:23,238 INFO L134 CoverageAnalysis]: Checked inductivity of 11990 backedges. 0 proven. 11990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:50:23,238 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 03:50:23,238 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 62] total 121 [2018-04-13 03:50:23,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-04-13 03:50:23,239 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-04-13 03:50:23,239 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=424, Invalid=14338, Unknown=0, NotChecked=0, Total=14762 [2018-04-13 03:50:23,239 INFO L87 Difference]: Start difference. First operand 460 states and 460 transitions. Second operand 122 states. [2018-04-13 03:50:37,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:50:37,605 INFO L93 Difference]: Finished difference Result 469 states and 469 transitions. [2018-04-13 03:50:37,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-04-13 03:50:37,605 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 452 [2018-04-13 03:50:37,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:50:37,606 INFO L225 Difference]: With dead ends: 469 [2018-04-13 03:50:37,606 INFO L226 Difference]: Without dead ends: 469 [2018-04-13 03:50:37,607 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 629 GetRequests, 390 SyntacticMatches, 6 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15034 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=1336, Invalid=53654, Unknown=0, NotChecked=0, Total=54990 [2018-04-13 03:50:37,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2018-04-13 03:50:37,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 468. [2018-04-13 03:50:37,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2018-04-13 03:50:37,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 468 transitions. [2018-04-13 03:50:37,610 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 468 transitions. Word has length 452 [2018-04-13 03:50:37,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:50:37,610 INFO L459 AbstractCegarLoop]: Abstraction has 468 states and 468 transitions. [2018-04-13 03:50:37,610 INFO L460 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-04-13 03:50:37,611 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 468 transitions. [2018-04-13 03:50:37,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2018-04-13 03:50:37,613 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:50:37,613 INFO L355 BasicCegarLoop]: trace histogram [57, 56, 56, 56, 56, 56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:50:37,613 INFO L408 AbstractCegarLoop]: === Iteration 62 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolationMEMORY_LEAK]=== [2018-04-13 03:50:37,613 INFO L82 PathProgramCache]: Analyzing trace with hash 949255837, now seen corresponding path program 56 times [2018-04-13 03:50:37,613 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:50:37,613 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:50:37,614 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:50:37,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 03:50:37,614 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:50:37,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:50:37,712 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:50:41,555 INFO L134 CoverageAnalysis]: Checked inductivity of 12432 backedges. 0 proven. 12432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:50:41,555 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:50:41,555 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:50:41,555 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 03:50:44,084 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 03:50:44,084 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:50:44,105 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:50:44,107 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:50:44,107 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:50:44,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:50:44,109 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-13 03:50:45,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:50:45,488 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 24 treesize of output 32 [2018-04-13 03:50:45,488 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:50:45,491 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:50:45,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:50:45,496 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:26 [2018-04-13 03:50:45,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:50:45,855 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 24 treesize of output 32 [2018-04-13 03:50:45,855 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:50:45,858 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:50:45,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:50:45,864 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:34 [2018-04-13 03:50:46,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 03:50:46,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 03:50:46,016 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:50:46,017 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:50:46,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:50:46,024 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:33 [2018-04-13 03:50:46,109 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 03:50:46,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:50:46,111 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:50:46,112 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:50:46,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:50:46,118 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:33 [2018-04-13 03:50:46,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-13 03:50:46,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:50:46,190 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:50:46,191 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:50:46,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:50:46,197 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:33 [2018-04-13 03:50:46,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-13 03:50:46,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:50:46,272 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:50:46,273 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:50:46,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:50:46,279 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:33 [2018-04-13 03:50:46,354 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 03:50:46,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:50:46,356 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:50:46,357 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:50:46,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:50:46,363 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:33 [2018-04-13 03:50:46,440 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 03:50:46,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:50:46,441 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:50:46,442 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:50:46,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:50:46,449 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:33 [2018-04-13 03:50:46,527 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 03:50:46,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:50:46,528 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:50:46,529 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:50:46,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:50:46,536 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:33 [2018-04-13 03:50:46,611 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 03:50:46,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:50:46,612 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:50:46,614 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:50:46,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:50:46,620 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:33 [2018-04-13 03:50:46,701 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 03:50:46,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:50:46,703 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:50:46,704 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:50:46,711 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:50:46,711 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:33 [2018-04-13 03:50:46,786 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 03:50:46,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:50:46,787 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:50:46,789 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:50:46,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:50:46,796 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:33 [2018-04-13 03:50:47,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:50:47,154 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 24 treesize of output 32 [2018-04-13 03:50:47,154 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:50:47,157 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:50:47,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:50:47,165 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:42 [2018-04-13 03:50:47,332 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 03:50:47,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:50:47,334 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:50:47,335 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:50:47,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:50:47,343 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:41 [2018-04-13 03:50:47,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-13 03:50:47,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 10 treesize of output 9 [2018-04-13 03:50:47,424 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:50:47,435 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:50:47,444 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:50:47,444 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:41 [2018-04-13 03:50:47,541 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 03:50:47,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:50:47,542 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:50:47,543 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:50:47,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:50:47,551 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:41 [2018-04-13 03:50:47,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:50:47,927 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 24 treesize of output 32 [2018-04-13 03:50:47,927 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:50:47,930 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:50:47,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:50:47,939 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:71, output treesize:50 [2018-04-13 03:50:48,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:50:48,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2018-04-13 03:50:48,440 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:50:48,443 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:50:48,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:50:48,453 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:79, output treesize:58 [2018-04-13 03:50:48,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:50:48,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2018-04-13 03:50:48,979 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:50:48,988 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:50:49,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:50:49,000 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:87, output treesize:66 [2018-04-13 03:50:49,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, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:50:49,567 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 24 treesize of output 32 [2018-04-13 03:50:49,567 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:50:49,570 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:50:49,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:50:49,582 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:95, output treesize:74 [2018-04-13 03:50:50,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:50:50,161 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 24 treesize of output 32 [2018-04-13 03:50:50,161 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:50:50,164 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:50:50,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:50:50,178 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:103, output treesize:82 [2018-04-13 03:50:50,425 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 03:50:50,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:50:50,426 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:50:50,427 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:50:50,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:50:50,441 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:94, output treesize:81 [2018-04-13 03:50:50,556 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 03:50:50,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:50:50,558 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:50:50,559 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:50:50,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:50:50,573 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:94, output treesize:81 [2018-04-13 03:50:50,693 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 03:50:50,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:50:50,694 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:50:50,695 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:50:50,710 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:50:50,710 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:94, output treesize:81 [2018-04-13 03:50:50,842 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 03:50:50,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:50:50,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:50:50,845 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:50:50,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:50:50,859 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:94, output treesize:81 [2018-04-13 03:50:51,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:50:51,385 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 24 treesize of output 32 [2018-04-13 03:50:51,385 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:50:51,389 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:50:51,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:50:51,406 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:111, output treesize:90 [2018-04-13 03:50:52,128 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:50:52,130 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 24 treesize of output 32 [2018-04-13 03:50:52,131 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:50:52,134 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:50:52,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:50:52,151 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:119, output treesize:98 [2018-04-13 03:50:52,548 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 03:50:52,549 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:50:52,549 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:50:52,550 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:50:52,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:50:52,567 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:110, output treesize:97 [2018-04-13 03:50:52,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 03:50:52,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:50:52,707 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:50:52,708 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:50:52,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:50:52,725 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:110, output treesize:97 [2018-04-13 03:50:53,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:50:53,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2018-04-13 03:50:53,308 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:50:53,311 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:50:53,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:50:53,331 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:127, output treesize:106 [2018-04-13 03:50:54,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-13 03:50:54,098 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 24 treesize of output 32 [2018-04-13 03:50:54,098 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:50:54,101 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:50:54,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:50:54,121 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:135, output treesize:114 [2018-04-13 03:50:54,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 03:50:54,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, 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 03:50:54,431 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:50:54,433 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:50:54,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:50:54,454 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:126, output treesize:113 [2018-04-13 03:50:54,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-13 03:50:54,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 03:50:54,609 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:50:54,611 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:50:54,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:50:54,632 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:126, output treesize:113 [2018-04-13 03:50:54,789 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 03:50:54,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:50:54,791 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:50:54,792 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:50:54,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:50:54,813 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:126, output treesize:113 [2018-04-13 03:50:55,132 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 03:50:55,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 03:50:55,136 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:50:55,138 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:50:55,143 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 03:50:55,143 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:48 [2018-04-13 03:50:56,255 INFO L134 CoverageAnalysis]: Checked inductivity of 12432 backedges. 0 proven. 12432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:50:56,255 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 03:50:56,256 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 111] total 172 [2018-04-13 03:50:56,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 173 states [2018-04-13 03:50:56,257 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 173 interpolants. [2018-04-13 03:50:56,257 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=697, Invalid=29059, Unknown=0, NotChecked=0, Total=29756 [2018-04-13 03:50:56,258 INFO L87 Difference]: Start difference. First operand 468 states and 468 transitions. Second operand 173 states. [2018-04-13 03:51:17,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:51:17,133 INFO L93 Difference]: Finished difference Result 477 states and 477 transitions. [2018-04-13 03:51:17,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2018-04-13 03:51:17,133 INFO L78 Accepts]: Start accepts. Automaton has 173 states. Word has length 460 [2018-04-13 03:51:17,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:51:17,134 INFO L225 Difference]: With dead ends: 477 [2018-04-13 03:51:17,134 INFO L226 Difference]: Without dead ends: 477 [2018-04-13 03:51:17,136 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 665 GetRequests, 350 SyntacticMatches, 5 SemanticMatches, 310 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31473 ImplicationChecksByTransitivity, 21.1s TimeCoverageRelationStatistics Valid=1974, Invalid=95058, Unknown=0, NotChecked=0, Total=97032 [2018-04-13 03:51:17,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2018-04-13 03:51:17,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 476. [2018-04-13 03:51:17,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2018-04-13 03:51:17,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 476 transitions. [2018-04-13 03:51:17,138 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 476 transitions. Word has length 460 [2018-04-13 03:51:17,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:51:17,138 INFO L459 AbstractCegarLoop]: Abstraction has 476 states and 476 transitions. [2018-04-13 03:51:17,138 INFO L460 AbstractCegarLoop]: Interpolant automaton has 173 states. [2018-04-13 03:51:17,138 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 476 transitions. [2018-04-13 03:51:17,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2018-04-13 03:51:17,139 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:51:17,140 INFO L355 BasicCegarLoop]: trace histogram [58, 57, 57, 57, 57, 57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:51:17,140 INFO L408 AbstractCegarLoop]: === Iteration 63 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolationMEMORY_LEAK]=== [2018-04-13 03:51:17,140 INFO L82 PathProgramCache]: Analyzing trace with hash 299742156, now seen corresponding path program 57 times [2018-04-13 03:51:17,140 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:51:17,140 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:51:17,140 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:51:17,140 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:51:17,141 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:51:17,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:51:17,238 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:51:20,986 INFO L134 CoverageAnalysis]: Checked inductivity of 12882 backedges. 0 proven. 12882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:51:20,986 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:51:20,986 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:51:20,987 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 03:51:21,877 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2018-04-13 03:51:21,877 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:51:21,898 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:51:21,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 03:51:21,900 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:51:21,902 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:21,902 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-13 03:51:24,443 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 03:51:24,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:51:24,444 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:51:24,445 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:24,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:24,449 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:51:24,518 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 03:51:24,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:51:24,519 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:51:24,520 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:24,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:24,525 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:51:24,591 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 03:51:24,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:51:24,593 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:51:24,594 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:24,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:24,598 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:51:24,668 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 03:51:24,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:51:24,669 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:51:24,670 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:24,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:24,674 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:51:24,741 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 03:51:24,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:51:24,742 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:51:24,743 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:24,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:24,747 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:51:24,814 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 03:51:24,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:51:24,816 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:51:24,817 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:24,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:24,821 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:51:24,885 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 03:51:24,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:51:24,887 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:51:24,888 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:24,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:24,892 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:51:24,960 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 03:51:24,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:51:24,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:51:24,962 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:24,967 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:24,967 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:51:25,036 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 03:51:25,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:51:25,037 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:51:25,038 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:25,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:25,042 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:51:25,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-13 03:51:25,109 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:51:25,110 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:51:25,111 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:25,115 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:25,115 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:51:25,184 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 03:51:25,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:51:25,186 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:51:25,187 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:25,191 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:25,191 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:51:25,262 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 03:51:25,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:51:25,263 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:51:25,264 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:25,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:25,268 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:51:25,338 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 03:51:25,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 10 treesize of output 9 [2018-04-13 03:51:25,339 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:51:25,340 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:25,344 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:25,344 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:51:25,491 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 03:51:25,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 03:51:25,494 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:51:25,496 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:51:25,500 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 03:51:25,501 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:34 [2018-04-13 03:51:26,196 INFO L134 CoverageAnalysis]: Checked inductivity of 12882 backedges. 0 proven. 12882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:51:26,197 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 03:51:26,197 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 126 [2018-04-13 03:51:26,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-04-13 03:51:26,197 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-04-13 03:51:26,198 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=436, Invalid=15566, Unknown=0, NotChecked=0, Total=16002 [2018-04-13 03:51:26,198 INFO L87 Difference]: Start difference. First operand 476 states and 476 transitions. Second operand 127 states. [2018-04-13 03:51:42,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:51:42,491 INFO L93 Difference]: Finished difference Result 485 states and 485 transitions. [2018-04-13 03:51:42,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-04-13 03:51:42,491 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 468 [2018-04-13 03:51:42,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:51:42,492 INFO L225 Difference]: With dead ends: 485 [2018-04-13 03:51:42,492 INFO L226 Difference]: Without dead ends: 485 [2018-04-13 03:51:42,493 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 651 GetRequests, 405 SyntacticMatches, 4 SemanticMatches, 242 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16428 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=1381, Invalid=57911, Unknown=0, NotChecked=0, Total=59292 [2018-04-13 03:51:42,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2018-04-13 03:51:42,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 484. [2018-04-13 03:51:42,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2018-04-13 03:51:42,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 484 transitions. [2018-04-13 03:51:42,495 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 484 transitions. Word has length 468 [2018-04-13 03:51:42,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:51:42,496 INFO L459 AbstractCegarLoop]: Abstraction has 484 states and 484 transitions. [2018-04-13 03:51:42,496 INFO L460 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-04-13 03:51:42,496 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 484 transitions. [2018-04-13 03:51:42,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2018-04-13 03:51:42,497 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:51:42,497 INFO L355 BasicCegarLoop]: trace histogram [59, 58, 58, 58, 58, 58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:51:42,497 INFO L408 AbstractCegarLoop]: === Iteration 64 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolationMEMORY_LEAK]=== [2018-04-13 03:51:42,497 INFO L82 PathProgramCache]: Analyzing trace with hash -172865029, now seen corresponding path program 58 times [2018-04-13 03:51:42,497 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:51:42,497 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:51:42,498 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:51:42,498 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:51:42,498 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:51:42,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:51:42,590 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:51:46,540 INFO L134 CoverageAnalysis]: Checked inductivity of 13340 backedges. 0 proven. 13340 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:51:46,541 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:51:46,541 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:51:46,541 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 03:51:52,097 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 03:51:52,097 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:51:52,139 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:51:52,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:51:52,140 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:51:52,143 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:52,143 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-13 03:51:53,615 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 03:51:53,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:51:53,616 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:51:53,617 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:53,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:53,622 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:51:53,684 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-13 03:51:53,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:51:53,685 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:51:53,686 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:53,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:53,691 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:51:53,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-13 03:51:53,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:51:53,752 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:51:53,753 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:53,757 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:53,757 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:51:53,818 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 03:51:53,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:51:53,819 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:51:53,820 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:53,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:53,824 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:51:53,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-13 03:51:53,887 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:51:53,887 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:51:53,888 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:53,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:53,893 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:51:53,960 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 03:51:53,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:51:53,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:51:53,962 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:53,967 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:53,967 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:51:54,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-13 03:51:54,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:51:54,028 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:51:54,029 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:54,033 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:54,033 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:51:54,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-13 03:51:54,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:51:54,106 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:51:54,108 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:54,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:54,112 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:51:54,175 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 03:51:54,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:51:54,177 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:51:54,178 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:54,182 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:54,182 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:51:54,247 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 03:51:54,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:51:54,249 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:51:54,250 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:54,254 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:54,254 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:51:54,320 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 03:51:54,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:51:54,321 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:51:54,322 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:54,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:54,326 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:51:54,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 03:51:54,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 10 treesize of output 9 [2018-04-13 03:51:54,394 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:51:54,395 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:54,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:54,399 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:51:54,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 03:51:54,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:51:54,466 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:51:54,467 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:54,471 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:54,471 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:51:54,538 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 03:51:54,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:51:54,539 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:51:54,540 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:54,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:54,545 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:51:54,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, 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 03:51:54,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:51:54,613 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:51:54,614 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:54,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:54,618 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:51:54,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-13 03:51:54,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:51:54,687 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:51:54,688 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:54,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:54,692 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:51:54,762 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 03:51:54,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:51:54,763 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:51:54,764 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:54,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:54,769 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:51:54,836 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 03:51:54,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:51:54,837 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:51:54,838 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:54,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:54,842 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:51:54,909 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 03:51:54,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 03:51:54,910 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:51:54,911 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:54,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:54,916 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:51:54,986 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 03:51:54,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:51:54,988 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:51:54,989 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:54,993 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:54,993 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:51:55,062 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 03:51:55,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 10 treesize of output 9 [2018-04-13 03:51:55,063 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:51:55,064 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:55,069 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:55,069 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:51:55,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 03:51:55,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:51:55,147 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:51:55,148 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:55,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:55,152 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:51:55,226 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 03:51:55,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:51:55,227 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:51:55,228 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:55,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:55,233 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:51:55,303 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 03:51:55,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:51:55,304 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:51:55,306 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:55,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:55,310 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:51:55,380 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 03:51:55,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:51:55,382 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:51:55,383 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:55,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:55,387 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:51:55,455 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 03:51:55,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:51:55,456 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:51:55,457 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:55,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:55,461 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:51:55,526 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 03:51:55,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:51:55,527 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:51:55,529 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:55,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:55,533 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:51:55,601 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 03:51:55,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:51:55,602 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:51:55,603 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:55,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:55,607 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:51:55,674 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 03:51:55,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 03:51:55,675 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:51:55,676 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:55,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:55,680 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:51:55,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 03:51:55,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:51:55,748 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:51:55,749 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:55,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:55,754 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:51:55,824 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 03:51:55,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 10 treesize of output 9 [2018-04-13 03:51:55,825 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:51:55,826 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:55,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:55,830 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:51:55,968 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 03:51:55,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:51:55,969 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:51:55,970 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:55,974 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:51:55,975 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:51:56,143 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 03:51:56,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 03:51:56,152 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:51:56,158 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:51:56,163 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 03:51:56,163 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:48 [2018-04-13 03:51:56,900 INFO L134 CoverageAnalysis]: Checked inductivity of 13340 backedges. 0 proven. 13340 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:51:56,900 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 03:51:56,928 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 65] total 128 [2018-04-13 03:51:56,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-04-13 03:51:56,929 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-04-13 03:51:56,930 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=16065, Unknown=0, NotChecked=0, Total=16512 [2018-04-13 03:51:56,930 INFO L87 Difference]: Start difference. First operand 484 states and 484 transitions. Second operand 129 states. [2018-04-13 03:52:12,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:52:12,146 INFO L93 Difference]: Finished difference Result 493 states and 493 transitions. [2018-04-13 03:52:12,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-04-13 03:52:12,146 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 476 [2018-04-13 03:52:12,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:52:12,147 INFO L225 Difference]: With dead ends: 493 [2018-04-13 03:52:12,148 INFO L226 Difference]: Without dead ends: 493 [2018-04-13 03:52:12,149 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 662 GetRequests, 412 SyntacticMatches, 5 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16864 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=1400, Invalid=59362, Unknown=0, NotChecked=0, Total=60762 [2018-04-13 03:52:12,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2018-04-13 03:52:12,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 492. [2018-04-13 03:52:12,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2018-04-13 03:52:12,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 492 transitions. [2018-04-13 03:52:12,152 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 492 transitions. Word has length 476 [2018-04-13 03:52:12,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:52:12,152 INFO L459 AbstractCegarLoop]: Abstraction has 492 states and 492 transitions. [2018-04-13 03:52:12,152 INFO L460 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-04-13 03:52:12,152 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 492 transitions. [2018-04-13 03:52:12,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2018-04-13 03:52:12,153 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:52:12,153 INFO L355 BasicCegarLoop]: trace histogram [60, 59, 59, 59, 59, 59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:52:12,153 INFO L408 AbstractCegarLoop]: === Iteration 65 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolationMEMORY_LEAK]=== [2018-04-13 03:52:12,153 INFO L82 PathProgramCache]: Analyzing trace with hash 388055338, now seen corresponding path program 59 times [2018-04-13 03:52:12,153 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:52:12,154 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:52:12,154 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:52:12,154 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:52:12,154 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:52:12,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:52:12,249 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:52:16,473 INFO L134 CoverageAnalysis]: Checked inductivity of 13806 backedges. 0 proven. 13806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:52:16,473 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:52:16,473 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:52:16,474 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 03:52:17,288 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2018-04-13 03:52:17,289 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:52:17,332 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:52:17,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 03:52:17,333 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:52:17,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:52:17,334 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2018-04-13 03:52:20,644 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 03:52:20,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:52:20,645 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:52:20,646 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:52:20,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:52:20,654 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:28 [2018-04-13 03:52:20,750 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 03:52:20,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 11 [2018-04-13 03:52:20,751 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:52:20,752 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:52:20,759 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:52:20,760 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:35 [2018-04-13 03:52:21,041 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 03:52:21,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:52:21,042 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:52:21,044 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:52:21,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:52:21,051 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:35 [2018-04-13 03:52:21,241 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 03:52:21,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 11 [2018-04-13 03:52:21,242 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:52:21,243 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:52:21,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:52:21,250 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:35 [2018-04-13 03:52:21,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-13 03:52:21,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 03:52:21,448 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:52:21,449 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:52:21,456 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:52:21,456 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:35 [2018-04-13 03:52:21,660 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 03:52:21,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 11 [2018-04-13 03:52:21,661 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:52:21,662 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:52:21,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:52:21,669 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:35 [2018-04-13 03:52:21,869 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 03:52:21,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 11 [2018-04-13 03:52:21,870 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:52:21,871 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:52:21,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:52:21,878 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:35 [2018-04-13 03:52:22,069 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 03:52:22,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 11 [2018-04-13 03:52:22,070 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:52:22,071 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:52:22,079 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:52:22,079 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:35 [2018-04-13 03:52:22,276 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 03:52:22,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:52:22,277 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:52:22,278 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:52:22,285 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:52:22,285 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:35 [2018-04-13 03:52:22,391 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 03:52:22,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:52:22,395 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:52:22,396 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:52:22,413 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:52:22,413 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:35 [2018-04-13 03:52:22,730 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-13 03:52:22,731 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 11 [2018-04-13 03:52:22,731 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:52:22,732 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:52:22,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:52:22,740 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:35 [2018-04-13 03:52:22,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 03:52:22,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:52:22,953 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:52:22,955 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:52:22,962 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:52:22,962 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:35 [2018-04-13 03:52:23,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-13 03:52:23,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 11 [2018-04-13 03:52:23,170 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:52:23,171 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:52:23,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:52:23,179 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:35 [2018-04-13 03:52:23,402 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 03:52:23,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 11 [2018-04-13 03:52:23,403 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:52:23,405 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:52:23,412 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:52:23,412 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:35 [2018-04-13 03:52:23,629 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 03:52:23,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 11 [2018-04-13 03:52:23,630 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:52:23,632 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:52:23,638 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:52:23,638 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:35 [2018-04-13 03:52:23,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-04-13 03:52:23,854 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-04-13 03:52:23,854 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:52:23,857 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:52:23,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 03:52:23,865 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:67 [2018-04-13 03:52:24,957 INFO L134 CoverageAnalysis]: Checked inductivity of 13806 backedges. 0 proven. 13806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:52:24,957 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 03:52:24,957 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 83] total 149 [2018-04-13 03:52:24,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 150 states [2018-04-13 03:52:24,958 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2018-04-13 03:52:24,958 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=673, Invalid=21677, Unknown=0, NotChecked=0, Total=22350 [2018-04-13 03:52:24,958 INFO L87 Difference]: Start difference. First operand 492 states and 492 transitions. Second operand 150 states. [2018-04-13 03:52:44,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 03:52:44,006 INFO L93 Difference]: Finished difference Result 501 states and 501 transitions. [2018-04-13 03:52:44,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2018-04-13 03:52:44,006 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 484 [2018-04-13 03:52:44,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 03:52:44,007 INFO L225 Difference]: With dead ends: 501 [2018-04-13 03:52:44,007 INFO L226 Difference]: Without dead ends: 501 [2018-04-13 03:52:44,008 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 673 GetRequests, 402 SyntacticMatches, 2 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20413 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=1910, Invalid=71260, Unknown=0, NotChecked=0, Total=73170 [2018-04-13 03:52:44,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2018-04-13 03:52:44,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 500. [2018-04-13 03:52:44,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2018-04-13 03:52:44,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 500 transitions. [2018-04-13 03:52:44,011 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 500 transitions. Word has length 484 [2018-04-13 03:52:44,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 03:52:44,011 INFO L459 AbstractCegarLoop]: Abstraction has 500 states and 500 transitions. [2018-04-13 03:52:44,011 INFO L460 AbstractCegarLoop]: Interpolant automaton has 150 states. [2018-04-13 03:52:44,011 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 500 transitions. [2018-04-13 03:52:44,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2018-04-13 03:52:44,013 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 03:52:44,013 INFO L355 BasicCegarLoop]: trace histogram [61, 60, 60, 60, 60, 60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 03:52:44,013 INFO L408 AbstractCegarLoop]: === Iteration 66 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolationMEMORY_LEAK]=== [2018-04-13 03:52:44,013 INFO L82 PathProgramCache]: Analyzing trace with hash 708417881, now seen corresponding path program 60 times [2018-04-13 03:52:44,013 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 03:52:44,013 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 03:52:44,014 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:52:44,014 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 03:52:44,014 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 03:52:44,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 03:52:44,113 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 03:52:48,364 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 14280 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:52:48,365 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 03:52:48,381 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 03:52:48,382 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 03:52:50,192 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2018-04-13 03:52:50,192 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 03:52:50,229 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 03:52:50,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 03:52:50,231 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 03:52:50,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:52:50,233 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-13 03:52:52,944 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 03:52:52,945 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:52:52,945 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:52:52,947 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:52:52,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:52:52,951 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:52:53,028 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 03:52:53,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:52:53,029 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:52:53,030 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:52:53,035 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:52:53,035 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:52:53,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-13 03:52:53,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:52:53,121 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:52:53,122 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:52:53,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:52:53,128 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:52:53,203 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 03:52:53,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 10 treesize of output 9 [2018-04-13 03:52:53,205 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:52:53,206 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:52:53,210 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:52:53,211 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:52:53,283 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 03:52:53,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:52:53,285 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:52:53,286 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:52:53,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:52:53,290 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:52:53,359 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 03:52:53,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:52:53,360 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:52:53,361 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:52:53,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:52:53,366 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:52:53,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, 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 03:52:53,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:52:53,474 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:52:53,475 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:52:53,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:52:53,479 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:52:53,546 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 03:52:53,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 10 treesize of output 9 [2018-04-13 03:52:53,547 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:52:53,548 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:52:53,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:52:53,552 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:52:53,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-13 03:52:53,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:52:53,625 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:52:53,627 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:52:53,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:52:53,632 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:52:53,710 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 03:52:53,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:52:53,711 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:52:53,712 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:52:53,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:52:53,717 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:52:53,800 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 03:52:53,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:52:53,801 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:52:53,802 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:52:53,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:52:53,807 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:52:53,887 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 03:52:53,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:52:53,888 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:52:53,889 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:52:53,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:52:53,894 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:52:53,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-13 03:52:53,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 03:52:53,985 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:52:53,987 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:52:53,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:52:53,992 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:52:54,083 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 03:52:54,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:52:54,084 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:52:54,085 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:52:54,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:52:54,090 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:52:54,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-13 03:52:54,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:52:54,186 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:52:54,187 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:52:54,192 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:52:54,192 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:52:54,275 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 03:52:54,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 03:52:54,277 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 03:52:54,278 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:52:54,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 03:52:54,282 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-04-13 03:52:54,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 19 treesize of output 15 [2018-04-13 03:52:54,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 03:52:54,461 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 03:52:54,463 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 03:52:54,468 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 03:52:54,468 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:48 [2018-04-13 03:52:55,204 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 14280 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 03:52:55,204 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 03:52:55,205 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 68] total 133 [2018-04-13 03:52:55,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-04-13 03:52:55,205 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-04-13 03:52:55,206 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=17357, Unknown=0, NotChecked=0, Total=17822 [2018-04-13 03:52:55,206 INFO L87 Difference]: Start difference. First operand 500 states and 500 transitions. Second operand 134 states. Received shutdown request... [2018-04-13 03:53:05,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-04-13 03:53:05,405 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-13 03:53:05,408 WARN L197 ceAbstractionStarter]: Timeout [2018-04-13 03:53:05,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 03:53:05 BoogieIcfgContainer [2018-04-13 03:53:05,408 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-13 03:53:05,409 INFO L168 Benchmark]: Toolchain (without parser) took 764142.00 ms. Allocated memory was 399.5 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 332.6 MB in the beginning and 1.6 GB in the end (delta: -1.3 GB). Peak memory consumption was 693.8 MB. Max. memory is 5.3 GB. [2018-04-13 03:53:05,410 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 399.5 MB. Free memory is still 361.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-13 03:53:05,410 INFO L168 Benchmark]: CACSL2BoogieTranslator took 244.07 ms. Allocated memory is still 399.5 MB. Free memory was 332.6 MB in the beginning and 308.8 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 5.3 GB. [2018-04-13 03:53:05,410 INFO L168 Benchmark]: Boogie Preprocessor took 40.23 ms. Allocated memory is still 399.5 MB. Free memory was 308.8 MB in the beginning and 306.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-13 03:53:05,410 INFO L168 Benchmark]: RCFGBuilder took 348.42 ms. Allocated memory was 399.5 MB in the beginning and 602.4 MB in the end (delta: 202.9 MB). Free memory was 306.2 MB in the beginning and 542.5 MB in the end (delta: -236.3 MB). Peak memory consumption was 21.5 MB. Max. memory is 5.3 GB. [2018-04-13 03:53:05,410 INFO L168 Benchmark]: TraceAbstraction took 763506.59 ms. Allocated memory was 602.4 MB in the beginning and 2.4 GB in the end (delta: 1.8 GB). Free memory was 539.9 MB in the beginning and 1.6 GB in the end (delta: -1.1 GB). Peak memory consumption was 698.3 MB. Max. memory is 5.3 GB. [2018-04-13 03:53:05,412 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.13 ms. Allocated memory is still 399.5 MB. Free memory is still 361.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 244.07 ms. Allocated memory is still 399.5 MB. Free memory was 332.6 MB in the beginning and 308.8 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 40.23 ms. Allocated memory is still 399.5 MB. Free memory was 308.8 MB in the beginning and 306.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 348.42 ms. Allocated memory was 399.5 MB in the beginning and 602.4 MB in the end (delta: 202.9 MB). Free memory was 306.2 MB in the beginning and 542.5 MB in the end (delta: -236.3 MB). Peak memory consumption was 21.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 763506.59 ms. Allocated memory was 602.4 MB in the beginning and 2.4 GB in the end (delta: 1.8 GB). Free memory was 539.9 MB in the beginning and 1.6 GB in the end (delta: -1.1 GB). Peak memory consumption was 698.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 548]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (500states) and interpolant automaton (currently 75 states, 134 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 547]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was constructing difference of abstraction (500states) and interpolant automaton (currently 75 states, 134 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 547]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was constructing difference of abstraction (500states) and interpolant automaton (currently 75 states, 134 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 548]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (500states) and interpolant automaton (currently 75 states, 134 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 548]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (500states) and interpolant automaton (currently 75 states, 134 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 548]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (500states) and interpolant automaton (currently 75 states, 134 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 547]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was constructing difference of abstraction (500states) and interpolant automaton (currently 75 states, 134 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 548]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (500states) and interpolant automaton (currently 75 states, 134 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 548]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (500states) and interpolant automaton (currently 75 states, 134 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 547]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was constructing difference of abstraction (500states) and interpolant automaton (currently 75 states, 134 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 540]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 540). Cancelled while BasicCegarLoop was constructing difference of abstraction (500states) and interpolant automaton (currently 75 states, 134 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 44 locations, 11 error locations. TIMEOUT Result, 763.4s OverallTime, 66 OverallIterations, 61 TraceHistogramMax, 413.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4161 SDtfs, 39436 SDslu, 228147 SDs, 0 SdLazy, 738561 SolverSat, 7115 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 222.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 21762 GetRequests, 12774 SyntacticMatches, 259 SemanticMatches, 8728 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 491697 ImplicationChecksByTransitivity, 397.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=500occurred in iteration=65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 65 MinimizatonAttempts, 67 StatesRemovedByMinimization, 60 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 58.7s SatisfiabilityAnalysisTime, 274.5s InterpolantComputationTime, 30826 NumberOfCodeBlocks, 30806 NumberOfCodeBlocksAsserted, 1087 NumberOfCheckSat, 30682 ConstructedInterpolants, 422 QuantifiedInterpolants, 258579881 SizeOfPredicates, 1203 NumberOfNonLiveVariables, 67120 ConjunctsInSsa, 9417 ConjunctsInUnsatCore, 126 InterpolantComputations, 6 PerfectInterpolantSequences, 2/583162 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/add_last-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-13_03-53-05-418.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/add_last-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-13_03-53-05-418.csv Completed graceful shutdown