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 -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-10 16:17:46,025 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-10 16:17:46,026 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-10 16:17:46,036 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-10 16:17:46,037 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-10 16:17:46,037 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-10 16:17:46,038 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-10 16:17:46,040 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-10 16:17:46,041 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-10 16:17:46,042 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-10 16:17:46,043 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-10 16:17:46,043 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-10 16:17:46,044 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-10 16:17:46,045 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-10 16:17:46,045 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-10 16:17:46,047 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-10 16:17:46,048 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-10 16:17:46,050 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-10 16:17:46,051 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-10 16:17:46,052 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-10 16:17:46,053 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-10 16:17:46,053 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-10 16:17:46,054 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-10 16:17:46,054 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-10 16:17:46,055 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-10 16:17:46,056 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-10 16:17:46,056 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-10 16:17:46,057 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-10 16:17:46,057 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-10 16:17:46,057 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-10 16:17:46,058 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-10 16:17:46,058 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-10 16:17:46,075 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-10 16:17:46,076 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-10 16:17:46,077 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-10 16:17:46,077 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-10 16:17:46,077 INFO L133 SettingsManager]: * Use SBE=true [2018-04-10 16:17:46,077 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-10 16:17:46,077 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-10 16:17:46,077 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-10 16:17:46,077 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-10 16:17:46,078 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-10 16:17:46,078 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-10 16:17:46,078 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-10 16:17:46,078 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-10 16:17:46,078 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-10 16:17:46,078 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-10 16:17:46,079 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-10 16:17:46,079 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-10 16:17:46,079 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-10 16:17:46,079 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-10 16:17:46,079 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-10 16:17:46,079 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-10 16:17:46,079 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-10 16:17:46,080 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-10 16:17:46,080 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-04-10 16:17:46,106 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-10 16:17:46,118 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-10 16:17:46,122 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-10 16:17:46,124 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-10 16:17:46,124 INFO L276 PluginConnector]: CDTParser initialized [2018-04-10 16:17:46,125 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,430 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGd860f8ccc [2018-04-10 16:17:46,615 INFO L287 CDTParser]: IsIndexed: true [2018-04-10 16:17:46,615 INFO L288 CDTParser]: Found 1 translation units. [2018-04-10 16:17:46,615 INFO L168 CDTParser]: Scanning dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,624 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-10 16:17:46,625 INFO L215 ultiparseSymbolTable]: [2018-04-10 16:17:46,625 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-10 16:17:46,625 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,625 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-10 16:17:46,625 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__register_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,625 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____fsword_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,625 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____uint64_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,625 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__ssize_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,626 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_once_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,626 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__off_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,626 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____nlink_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,626 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_attr_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,626 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____int8_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,626 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__timer_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,626 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____sig_atomic_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,626 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__wchar_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,626 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____socklen_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,626 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,626 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____fd_mask in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,627 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____useconds_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,627 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_condattr_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,627 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____fsfilcnt64_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,627 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____int64_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,627 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__ldiv_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,627 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__ino_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,627 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____time_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,627 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____timer_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,627 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_mutexattr_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,627 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____key_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,628 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____uint8_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,628 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____daddr_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,628 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__loff_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,628 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__int8_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,628 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____fsfilcnt_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,628 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__u_int64_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,628 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____fsblkcnt64_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,628 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____rlim_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,628 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__quad_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,628 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__int64_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,628 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__u_int16_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,629 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__fsid_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,629 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__mode_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,629 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_cond_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,629 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____u_short in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,629 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____clock_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,629 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_spinlock_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,629 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__div_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,629 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__size_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,629 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____clockid_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,629 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__suseconds_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,630 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____loff_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,630 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__uid_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,630 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__fd_set in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,630 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____mode_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,630 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____fsid_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,630 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__blksize_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,630 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__clock_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,630 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____uint32_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,630 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____intptr_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,630 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pid_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,630 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__u_long in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,630 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____int16_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,630 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____ino_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,630 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__u_short in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,630 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__gid_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,630 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__SLL in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,631 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____sigset_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,631 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__caddr_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,631 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__u_int32_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,631 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_barrierattr_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,631 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__blkcnt_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,631 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__sigset_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,631 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__ulong in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,631 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____u_long in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,631 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____caddr_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,631 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_key_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,631 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__u_char in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,631 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____dev_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,631 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____fsblkcnt_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,631 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__int16_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,631 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__lldiv_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,631 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____uint16_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,631 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____id_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,631 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____quad_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,631 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__daddr_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,632 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____qaddr_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,632 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____gid_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,632 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____blksize_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,632 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____syscall_ulong_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,632 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____u_quad_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,632 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_barrier_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,632 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__fsblkcnt_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,632 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____pid_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,632 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__u_quad_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,632 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____off64_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,632 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____suseconds_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,633 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__ushort in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,633 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____u_char in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,633 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____rlim64_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,633 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__u_int in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,633 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____blkcnt_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,633 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__fd_mask in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,633 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_mutex_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,633 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____int32_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,633 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____syscall_slong_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,633 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__time_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,633 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____u_int in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,633 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____pthread_slist_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,634 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__u_int8_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,634 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__idtype_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,634 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__key_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,634 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__clockid_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,634 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____ssize_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,634 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_rwlock_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,634 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__uint in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,634 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__nlink_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,634 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__int32_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,634 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__id_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,634 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____off_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,635 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__dev_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,635 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__fsfilcnt_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,635 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_rwlockattr_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,635 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____blkcnt64_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,635 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____uid_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,635 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____ino64_t in dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:46,649 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGd860f8ccc [2018-04-10 16:17:46,653 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-10 16:17:46,653 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-10 16:17:46,654 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-10 16:17:46,654 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-10 16:17:46,658 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-10 16:17:46,659 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 04:17:46" (1/1) ... [2018-04-10 16:17:46,661 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c34a55b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:17:46, skipping insertion in model container [2018-04-10 16:17:46,661 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 04:17:46" (1/1) ... [2018-04-10 16:17:46,672 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 16:17:46,692 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 16:17:46,829 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 16:17:46,869 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 16:17:46,875 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 115 non ball SCCs. Number of states in SCCs 115. [2018-04-10 16:17:46,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:17:46 WrapperNode [2018-04-10 16:17:46,911 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-10 16:17:46,911 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-10 16:17:46,911 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-10 16:17:46,912 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-10 16:17:46,921 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:17:46" (1/1) ... [2018-04-10 16:17:46,921 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:17:46" (1/1) ... [2018-04-10 16:17:46,933 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:17:46" (1/1) ... [2018-04-10 16:17:46,933 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:17:46" (1/1) ... [2018-04-10 16:17:46,943 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:17:46" (1/1) ... [2018-04-10 16:17:46,949 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:17:46" (1/1) ... [2018-04-10 16:17:46,951 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:17:46" (1/1) ... [2018-04-10 16:17:46,955 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-10 16:17:46,956 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-10 16:17:46,956 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-10 16:17:46,956 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-10 16:17:46,957 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:17:46" (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-10 16:17:47,042 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-10 16:17:47,042 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-10 16:17:47,042 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-10 16:17:47,042 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-10 16:17:47,042 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-10 16:17:47,042 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-10 16:17:47,042 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-10 16:17:47,042 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-10 16:17:47,042 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-10 16:17:47,042 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-10 16:17:47,042 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-10 16:17:47,042 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-10 16:17:47,042 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-10 16:17:47,043 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-10 16:17:47,043 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-10 16:17:47,043 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-10 16:17:47,043 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-10 16:17:47,043 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-10 16:17:47,043 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-10 16:17:47,043 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-10 16:17:47,043 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-10 16:17:47,043 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-10 16:17:47,043 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-10 16:17:47,043 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-10 16:17:47,043 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-10 16:17:47,043 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-10 16:17:47,043 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-10 16:17:47,043 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-10 16:17:47,043 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-10 16:17:47,044 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-10 16:17:47,044 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-10 16:17:47,044 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-10 16:17:47,044 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-10 16:17:47,044 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-10 16:17:47,044 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-10 16:17:47,044 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-10 16:17:47,044 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-10 16:17:47,044 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-10 16:17:47,044 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-10 16:17:47,044 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-10 16:17:47,044 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-10 16:17:47,044 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-10 16:17:47,044 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-10 16:17:47,044 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-10 16:17:47,044 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-10 16:17:47,044 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-10 16:17:47,045 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-10 16:17:47,045 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-10 16:17:47,045 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-10 16:17:47,045 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-10 16:17:47,045 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-10 16:17:47,045 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-10 16:17:47,045 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-10 16:17:47,045 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-10 16:17:47,045 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-10 16:17:47,045 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-10 16:17:47,045 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-10 16:17:47,045 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-10 16:17:47,045 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-10 16:17:47,045 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-10 16:17:47,045 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-10 16:17:47,045 INFO L128 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-04-10 16:17:47,045 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-10 16:17:47,045 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-10 16:17:47,045 INFO L128 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-04-10 16:17:47,046 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-10 16:17:47,046 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-10 16:17:47,046 INFO L128 BoogieDeclarations]: Found specification of procedure quick_exit [2018-04-10 16:17:47,046 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-10 16:17:47,046 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-10 16:17:47,046 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-10 16:17:47,046 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-10 16:17:47,046 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-10 16:17:47,046 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-10 16:17:47,046 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-10 16:17:47,046 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-10 16:17:47,046 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-10 16:17:47,046 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-10 16:17:47,046 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-10 16:17:47,046 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-10 16:17:47,046 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-10 16:17:47,046 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-10 16:17:47,046 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-10 16:17:47,047 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-10 16:17:47,047 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-10 16:17:47,047 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-10 16:17:47,047 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-10 16:17:47,047 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-10 16:17:47,047 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-10 16:17:47,047 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-10 16:17:47,047 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-10 16:17:47,047 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-10 16:17:47,047 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-10 16:17:47,047 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-10 16:17:47,048 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-10 16:17:47,048 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-10 16:17:47,048 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-10 16:17:47,048 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-10 16:17:47,048 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-10 16:17:47,048 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-10 16:17:47,048 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-10 16:17:47,048 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-10 16:17:47,048 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-10 16:17:47,049 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-10 16:17:47,049 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-10 16:17:47,049 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-10 16:17:47,049 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-10 16:17:47,049 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-10 16:17:47,049 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-10 16:17:47,049 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-10 16:17:47,049 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-10 16:17:47,049 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-10 16:17:47,049 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-10 16:17:47,050 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-10 16:17:47,050 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-10 16:17:47,050 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-10 16:17:47,050 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-10 16:17:47,050 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-10 16:17:47,448 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-10 16:17:47,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 04:17:47 BoogieIcfgContainer [2018-04-10 16:17:47,448 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-10 16:17:47,449 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-10 16:17:47,449 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-10 16:17:47,453 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-10 16:17:47,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.04 04:17:46" (1/3) ... [2018-04-10 16:17:47,453 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47a69bae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 04:17:47, skipping insertion in model container [2018-04-10 16:17:47,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:17:46" (2/3) ... [2018-04-10 16:17:47,454 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47a69bae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 04:17:47, skipping insertion in model container [2018-04-10 16:17:47,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 04:17:47" (3/3) ... [2018-04-10 16:17:47,456 INFO L107 eAbstractionObserver]: Analyzing ICFG dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-10 16:17:47,465 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-10 16:17:47,471 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 57 error locations. [2018-04-10 16:17:47,505 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-10 16:17:47,506 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-10 16:17:47,506 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-10 16:17:47,506 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-10 16:17:47,506 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-10 16:17:47,506 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-10 16:17:47,506 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-10 16:17:47,506 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-10 16:17:47,507 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-10 16:17:47,507 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-10 16:17:47,521 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states. [2018-04-10 16:17:47,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-10 16:17:47,528 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:17:47,528 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:17:47,528 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:17:47,531 INFO L82 PathProgramCache]: Analyzing trace with hash -401927193, now seen corresponding path program 1 times [2018-04-10 16:17:47,532 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:17:47,533 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:17:47,573 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:17:47,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:17:47,574 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:17:47,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:17:47,608 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:17:47,658 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-10 16:17:47,660 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:17:47,661 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 16:17:47,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 16:17:47,675 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 16:17:47,675 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 16:17:47,677 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 4 states. [2018-04-10 16:17:47,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:17:47,905 INFO L93 Difference]: Finished difference Result 179 states and 190 transitions. [2018-04-10 16:17:47,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-10 16:17:47,906 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-10 16:17:47,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:17:47,915 INFO L225 Difference]: With dead ends: 179 [2018-04-10 16:17:47,915 INFO L226 Difference]: Without dead ends: 170 [2018-04-10 16:17:47,917 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:17:47,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-04-10 16:17:47,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 126. [2018-04-10 16:17:47,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-04-10 16:17:47,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 133 transitions. [2018-04-10 16:17:47,948 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 133 transitions. Word has length 8 [2018-04-10 16:17:47,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:17:47,948 INFO L459 AbstractCegarLoop]: Abstraction has 126 states and 133 transitions. [2018-04-10 16:17:47,948 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 16:17:47,949 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 133 transitions. [2018-04-10 16:17:47,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-10 16:17:47,949 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:17:47,949 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:17:47,949 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:17:47,949 INFO L82 PathProgramCache]: Analyzing trace with hash -401927192, now seen corresponding path program 1 times [2018-04-10 16:17:47,949 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:17:47,950 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:17:47,951 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:17:47,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:17:47,952 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:17:47,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:17:47,965 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:17:48,002 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-10 16:17:48,003 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:17:48,003 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 16:17:48,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 16:17:48,004 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 16:17:48,004 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 16:17:48,005 INFO L87 Difference]: Start difference. First operand 126 states and 133 transitions. Second operand 4 states. [2018-04-10 16:17:48,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:17:48,127 INFO L93 Difference]: Finished difference Result 153 states and 162 transitions. [2018-04-10 16:17:48,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-10 16:17:48,127 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-10 16:17:48,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:17:48,128 INFO L225 Difference]: With dead ends: 153 [2018-04-10 16:17:48,128 INFO L226 Difference]: Without dead ends: 153 [2018-04-10 16:17:48,129 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:17:48,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-04-10 16:17:48,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 123. [2018-04-10 16:17:48,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-04-10 16:17:48,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 130 transitions. [2018-04-10 16:17:48,136 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 130 transitions. Word has length 8 [2018-04-10 16:17:48,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:17:48,136 INFO L459 AbstractCegarLoop]: Abstraction has 123 states and 130 transitions. [2018-04-10 16:17:48,136 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 16:17:48,136 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 130 transitions. [2018-04-10 16:17:48,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-10 16:17:48,137 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:17:48,137 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:17:48,137 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:17:48,137 INFO L82 PathProgramCache]: Analyzing trace with hash -166598540, now seen corresponding path program 1 times [2018-04-10 16:17:48,137 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:17:48,137 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:17:48,138 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:17:48,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:17:48,139 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:17:48,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:17:48,154 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:17:48,161 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:17:48,161 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:17:48,162 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:17:48,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:17:48,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:17:48,199 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:17:48,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 6 treesize of output 5 [2018-04-10 16:17:48,235 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:17:48,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:17:48,238 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-10 16:17:48,257 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:17:48,259 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:17:48,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-10 16:17:48,261 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:17:48,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:17:48,272 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-04-10 16:17:48,294 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-10 16:17:48,295 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:17:48,295 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 16:17:48,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 16:17:48,295 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 16:17:48,295 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-10 16:17:48,295 INFO L87 Difference]: Start difference. First operand 123 states and 130 transitions. Second operand 6 states. [2018-04-10 16:17:48,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:17:48,507 INFO L93 Difference]: Finished difference Result 137 states and 145 transitions. [2018-04-10 16:17:48,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-10 16:17:48,507 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-04-10 16:17:48,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:17:48,509 INFO L225 Difference]: With dead ends: 137 [2018-04-10 16:17:48,510 INFO L226 Difference]: Without dead ends: 137 [2018-04-10 16:17:48,510 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-04-10 16:17:48,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-04-10 16:17:48,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 118. [2018-04-10 16:17:48,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-04-10 16:17:48,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 130 transitions. [2018-04-10 16:17:48,515 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 130 transitions. Word has length 16 [2018-04-10 16:17:48,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:17:48,516 INFO L459 AbstractCegarLoop]: Abstraction has 118 states and 130 transitions. [2018-04-10 16:17:48,516 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 16:17:48,516 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 130 transitions. [2018-04-10 16:17:48,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-10 16:17:48,516 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:17:48,516 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:17:48,516 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:17:48,517 INFO L82 PathProgramCache]: Analyzing trace with hash -166598539, now seen corresponding path program 1 times [2018-04-10 16:17:48,517 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:17:48,517 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:17:48,518 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:17:48,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:17:48,518 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:17:48,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:17:48,530 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:17:48,532 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:17:48,532 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:17:48,533 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:17:48,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:17:48,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:17:48,556 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:17:48,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:17:48,564 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:17:48,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 6 treesize of output 5 [2018-04-10 16:17:48,572 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:17:48,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:17:48,577 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-10 16:17:48,621 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:17:48,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-10 16:17:48,622 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:17:48,634 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:17:48,634 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:17:48,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-10 16:17:48,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:17:48,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:17:48,640 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:21 [2018-04-10 16:17:48,650 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-10 16:17:48,650 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:17:48,650 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-10 16:17:48,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-10 16:17:48,651 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-10 16:17:48,651 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-04-10 16:17:48,651 INFO L87 Difference]: Start difference. First operand 118 states and 130 transitions. Second operand 7 states. [2018-04-10 16:17:48,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:17:48,981 INFO L93 Difference]: Finished difference Result 206 states and 223 transitions. [2018-04-10 16:17:48,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-10 16:17:48,981 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-04-10 16:17:48,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:17:48,983 INFO L225 Difference]: With dead ends: 206 [2018-04-10 16:17:48,983 INFO L226 Difference]: Without dead ends: 206 [2018-04-10 16:17:48,983 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-04-10 16:17:48,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-04-10 16:17:48,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 164. [2018-04-10 16:17:48,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-04-10 16:17:48,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 194 transitions. [2018-04-10 16:17:48,993 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 194 transitions. Word has length 16 [2018-04-10 16:17:48,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:17:48,993 INFO L459 AbstractCegarLoop]: Abstraction has 164 states and 194 transitions. [2018-04-10 16:17:48,993 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-10 16:17:48,993 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 194 transitions. [2018-04-10 16:17:48,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-10 16:17:48,994 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:17:48,994 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-10 16:17:48,995 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:17:48,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1187407017, now seen corresponding path program 1 times [2018-04-10 16:17:48,995 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:17:48,995 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:17:48,996 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:17:48,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:17:48,996 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:17:49,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:17:49,006 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:17:49,029 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-10 16:17:49,029 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:17:49,029 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 16:17:49,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:17:49,029 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:17:49,029 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:17:49,030 INFO L87 Difference]: Start difference. First operand 164 states and 194 transitions. Second operand 5 states. [2018-04-10 16:17:49,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:17:49,176 INFO L93 Difference]: Finished difference Result 279 states and 331 transitions. [2018-04-10 16:17:49,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 16:17:49,176 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-04-10 16:17:49,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:17:49,177 INFO L225 Difference]: With dead ends: 279 [2018-04-10 16:17:49,177 INFO L226 Difference]: Without dead ends: 279 [2018-04-10 16:17:49,177 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-10 16:17:49,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-04-10 16:17:49,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 163. [2018-04-10 16:17:49,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-04-10 16:17:49,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 192 transitions. [2018-04-10 16:17:49,183 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 192 transitions. Word has length 18 [2018-04-10 16:17:49,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:17:49,183 INFO L459 AbstractCegarLoop]: Abstraction has 163 states and 192 transitions. [2018-04-10 16:17:49,183 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:17:49,183 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 192 transitions. [2018-04-10 16:17:49,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-10 16:17:49,184 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:17:49,184 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-10 16:17:49,184 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:17:49,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1187407016, now seen corresponding path program 1 times [2018-04-10 16:17:49,184 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:17:49,184 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:17:49,185 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:17:49,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:17:49,185 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:17:49,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:17:49,192 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:17:49,229 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-10 16:17:49,229 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:17:49,229 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 16:17:49,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:17:49,230 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:17:49,230 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:17:49,230 INFO L87 Difference]: Start difference. First operand 163 states and 192 transitions. Second operand 5 states. [2018-04-10 16:17:49,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:17:49,442 INFO L93 Difference]: Finished difference Result 286 states and 340 transitions. [2018-04-10 16:17:49,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 16:17:49,443 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-04-10 16:17:49,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:17:49,444 INFO L225 Difference]: With dead ends: 286 [2018-04-10 16:17:49,444 INFO L226 Difference]: Without dead ends: 286 [2018-04-10 16:17:49,444 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-10 16:17:49,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-04-10 16:17:49,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 162. [2018-04-10 16:17:49,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-04-10 16:17:49,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 190 transitions. [2018-04-10 16:17:49,448 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 190 transitions. Word has length 18 [2018-04-10 16:17:49,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:17:49,449 INFO L459 AbstractCegarLoop]: Abstraction has 162 states and 190 transitions. [2018-04-10 16:17:49,449 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:17:49,449 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 190 transitions. [2018-04-10 16:17:49,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-10 16:17:49,449 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:17:49,449 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:17:49,450 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:17:49,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1810792676, now seen corresponding path program 1 times [2018-04-10 16:17:49,450 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:17:49,450 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:17:49,451 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:17:49,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:17:49,451 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:17:49,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:17:49,459 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:17:49,479 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-10 16:17:49,480 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:17:49,480 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 16:17:49,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 16:17:49,480 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 16:17:49,480 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 16:17:49,480 INFO L87 Difference]: Start difference. First operand 162 states and 190 transitions. Second operand 4 states. [2018-04-10 16:17:49,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:17:49,556 INFO L93 Difference]: Finished difference Result 179 states and 198 transitions. [2018-04-10 16:17:49,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 16:17:49,556 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-04-10 16:17:49,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:17:49,557 INFO L225 Difference]: With dead ends: 179 [2018-04-10 16:17:49,557 INFO L226 Difference]: Without dead ends: 179 [2018-04-10 16:17:49,557 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:17:49,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-04-10 16:17:49,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 161. [2018-04-10 16:17:49,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-04-10 16:17:49,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 189 transitions. [2018-04-10 16:17:49,560 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 189 transitions. Word has length 19 [2018-04-10 16:17:49,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:17:49,560 INFO L459 AbstractCegarLoop]: Abstraction has 161 states and 189 transitions. [2018-04-10 16:17:49,560 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 16:17:49,560 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 189 transitions. [2018-04-10 16:17:49,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-10 16:17:49,561 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:17:49,561 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:17:49,561 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:17:49,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1810792677, now seen corresponding path program 1 times [2018-04-10 16:17:49,561 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:17:49,561 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:17:49,562 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:17:49,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:17:49,562 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:17:49,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:17:49,569 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:17:49,593 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-10 16:17:49,593 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:17:49,593 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 16:17:49,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 16:17:49,594 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 16:17:49,594 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 16:17:49,594 INFO L87 Difference]: Start difference. First operand 161 states and 189 transitions. Second operand 4 states. [2018-04-10 16:17:49,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:17:49,669 INFO L93 Difference]: Finished difference Result 180 states and 201 transitions. [2018-04-10 16:17:49,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-10 16:17:49,670 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-04-10 16:17:49,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:17:49,670 INFO L225 Difference]: With dead ends: 180 [2018-04-10 16:17:49,671 INFO L226 Difference]: Without dead ends: 180 [2018-04-10 16:17:49,671 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:17:49,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-04-10 16:17:49,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 158. [2018-04-10 16:17:49,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-04-10 16:17:49,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 186 transitions. [2018-04-10 16:17:49,674 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 186 transitions. Word has length 19 [2018-04-10 16:17:49,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:17:49,674 INFO L459 AbstractCegarLoop]: Abstraction has 158 states and 186 transitions. [2018-04-10 16:17:49,675 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 16:17:49,675 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 186 transitions. [2018-04-10 16:17:49,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-10 16:17:49,675 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:17:49,675 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:17:49,675 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:17:49,675 INFO L82 PathProgramCache]: Analyzing trace with hash 29390169, now seen corresponding path program 1 times [2018-04-10 16:17:49,676 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:17:49,676 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:17:49,676 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:17:49,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:17:49,677 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:17:49,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:17:49,685 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:17:49,688 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:17:49,688 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:17:49,688 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:17:49,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:17:49,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:17:49,722 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:17:49,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:17:49,735 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:17:49,738 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:17:49,738 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-10 16:17:49,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 11 treesize of output 8 [2018-04-10 16:17:49,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:17:49,750 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:17:49,751 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:17:49,759 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:17:49,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:17:49,761 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:17:49,762 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:17:49,767 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:17:49,767 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:34, output treesize:20 [2018-04-10 16:17:49,777 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-10 16:17:49,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-10 16:17:49,779 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:17:49,780 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:17:49,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:17:49,783 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:16 [2018-04-10 16:17:49,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 35 [2018-04-10 16:17:49,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-04-10 16:17:49,806 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:17:49,821 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:17:49,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 16:17:49,826 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:25 [2018-04-10 16:17:49,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2018-04-10 16:17:49,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-04-10 16:17:49,847 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:17:49,851 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:17:49,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:17:49,854 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:35, output treesize:5 [2018-04-10 16:17:49,864 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-10 16:17:49,864 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:17:49,864 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-10 16:17:49,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-10 16:17:49,865 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-10 16:17:49,865 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-04-10 16:17:49,865 INFO L87 Difference]: Start difference. First operand 158 states and 186 transitions. Second operand 11 states. [2018-04-10 16:17:50,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:17:50,292 INFO L93 Difference]: Finished difference Result 185 states and 204 transitions. [2018-04-10 16:17:50,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-10 16:17:50,292 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-04-10 16:17:50,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:17:50,293 INFO L225 Difference]: With dead ends: 185 [2018-04-10 16:17:50,293 INFO L226 Difference]: Without dead ends: 185 [2018-04-10 16:17:50,293 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=157, Invalid=349, Unknown=0, NotChecked=0, Total=506 [2018-04-10 16:17:50,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-04-10 16:17:50,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 160. [2018-04-10 16:17:50,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-04-10 16:17:50,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 189 transitions. [2018-04-10 16:17:50,297 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 189 transitions. Word has length 22 [2018-04-10 16:17:50,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:17:50,297 INFO L459 AbstractCegarLoop]: Abstraction has 160 states and 189 transitions. [2018-04-10 16:17:50,297 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-10 16:17:50,297 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 189 transitions. [2018-04-10 16:17:50,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-10 16:17:50,298 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:17:50,298 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:17:50,298 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:17:50,298 INFO L82 PathProgramCache]: Analyzing trace with hash 29390170, now seen corresponding path program 1 times [2018-04-10 16:17:50,299 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:17:50,299 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:17:50,300 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:17:50,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:17:50,300 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:17:50,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:17:50,309 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:17:50,312 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:17:50,312 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:17:50,312 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:17:50,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:17:50,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:17:50,338 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:17:50,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:17:50,357 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:17:50,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:17:50,361 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-10 16:17:50,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 11 treesize of output 8 [2018-04-10 16:17:50,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 8 treesize of output 7 [2018-04-10 16:17:50,377 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:17:50,379 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:17:50,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:17:50,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:17:50,389 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:17:50,391 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:17:50,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:17:50,419 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:31, output treesize:20 [2018-04-10 16:17:50,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 35 [2018-04-10 16:17:50,469 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:17:50,470 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 28 [2018-04-10 16:17:50,471 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:17:50,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-10 16:17:50,491 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:17:50,499 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:17:50,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 56 [2018-04-10 16:17:50,532 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:17:50,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2018-04-10 16:17:50,534 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:17:50,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-04-10 16:17:50,556 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:17:50,567 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:17:50,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 16:17:50,577 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:53, output treesize:57 [2018-04-10 16:17:50,606 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 91 [2018-04-10 16:17:50,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 65 [2018-04-10 16:17:50,611 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:17:50,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 49 [2018-04-10 16:17:50,632 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:17:50,652 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:17:50,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 57 [2018-04-10 16:17:50,655 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:17:50,673 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-10 16:17:50,697 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 44 [2018-04-10 16:17:50,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 7 [2018-04-10 16:17:50,700 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:17:50,708 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-04-10 16:17:50,709 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 16:17:50,714 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:17:50,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 48 [2018-04-10 16:17:50,726 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:17:50,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 24 [2018-04-10 16:17:50,728 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 16:17:50,744 INFO L267 ElimStorePlain]: Start of recursive call 9: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:17:50,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:17:50,753 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:107, output treesize:9 [2018-04-10 16:17:50,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:17:50,775 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:17:50,776 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-10 16:17:50,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-10 16:17:50,776 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-10 16:17:50,776 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-04-10 16:17:50,776 INFO L87 Difference]: Start difference. First operand 160 states and 189 transitions. Second operand 11 states. [2018-04-10 16:17:51,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:17:51,223 INFO L93 Difference]: Finished difference Result 208 states and 231 transitions. [2018-04-10 16:17:51,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-10 16:17:51,223 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-04-10 16:17:51,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:17:51,224 INFO L225 Difference]: With dead ends: 208 [2018-04-10 16:17:51,224 INFO L226 Difference]: Without dead ends: 208 [2018-04-10 16:17:51,225 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=219, Invalid=431, Unknown=0, NotChecked=0, Total=650 [2018-04-10 16:17:51,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-04-10 16:17:51,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 155. [2018-04-10 16:17:51,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-04-10 16:17:51,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 183 transitions. [2018-04-10 16:17:51,228 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 183 transitions. Word has length 22 [2018-04-10 16:17:51,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:17:51,229 INFO L459 AbstractCegarLoop]: Abstraction has 155 states and 183 transitions. [2018-04-10 16:17:51,229 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-10 16:17:51,229 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 183 transitions. [2018-04-10 16:17:51,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-10 16:17:51,229 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:17:51,230 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:17:51,230 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:17:51,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1340356530, now seen corresponding path program 1 times [2018-04-10 16:17:51,230 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:17:51,230 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:17:51,231 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:17:51,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:17:51,231 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:17:51,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:17:51,239 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:17:51,240 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:17:51,241 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:17:51,241 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:17:51,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:17:51,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:17:51,258 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:17:51,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:17:51,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 8 treesize of output 7 [2018-04-10 16:17:51,269 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:17:51,270 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:17:51,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 11 treesize of output 8 [2018-04-10 16:17:51,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 8 treesize of output 7 [2018-04-10 16:17:51,278 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:17:51,279 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:17:51,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:17:51,283 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2018-04-10 16:17:51,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-10 16:17:51,302 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:17:51,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 16:17:51,303 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:17:51,308 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:17:51,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-10 16:17:51,317 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:17:51,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 16:17:51,317 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:17:51,320 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:17:51,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:17:51,326 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-04-10 16:17:51,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-04-10 16:17:51,354 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:17:51,354 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:17:51,355 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:17:51,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2018-04-10 16:17:51,356 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:17:51,359 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:17:51,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-04-10 16:17:51,374 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:17:51,374 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:17:51,375 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:17:51,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2018-04-10 16:17:51,375 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:17:51,383 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:17:51,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:17:51,388 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:59, output treesize:7 [2018-04-10 16:17:51,395 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-10 16:17:51,396 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:17:51,396 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-10 16:17:51,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 16:17:51,396 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 16:17:51,396 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-04-10 16:17:51,396 INFO L87 Difference]: Start difference. First operand 155 states and 183 transitions. Second operand 8 states. [2018-04-10 16:17:51,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:17:51,741 INFO L93 Difference]: Finished difference Result 178 states and 199 transitions. [2018-04-10 16:17:51,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-10 16:17:51,741 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2018-04-10 16:17:51,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:17:51,742 INFO L225 Difference]: With dead ends: 178 [2018-04-10 16:17:51,742 INFO L226 Difference]: Without dead ends: 178 [2018-04-10 16:17:51,742 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-04-10 16:17:51,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-04-10 16:17:51,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 160. [2018-04-10 16:17:51,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-04-10 16:17:51,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 189 transitions. [2018-04-10 16:17:51,745 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 189 transitions. Word has length 24 [2018-04-10 16:17:51,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:17:51,745 INFO L459 AbstractCegarLoop]: Abstraction has 160 states and 189 transitions. [2018-04-10 16:17:51,745 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 16:17:51,745 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 189 transitions. [2018-04-10 16:17:51,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-10 16:17:51,745 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:17:51,745 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:17:51,746 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:17:51,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1381455388, now seen corresponding path program 1 times [2018-04-10 16:17:51,746 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:17:51,746 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:17:51,746 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:17:51,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:17:51,747 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:17:51,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:17:51,752 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:17:51,802 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-10 16:17:51,802 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:17:51,803 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 16:17:51,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:17:51,803 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:17:51,803 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:17:51,803 INFO L87 Difference]: Start difference. First operand 160 states and 189 transitions. Second operand 5 states. [2018-04-10 16:17:51,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:17:51,928 INFO L93 Difference]: Finished difference Result 196 states and 215 transitions. [2018-04-10 16:17:51,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 16:17:51,928 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-04-10 16:17:51,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:17:51,929 INFO L225 Difference]: With dead ends: 196 [2018-04-10 16:17:51,929 INFO L226 Difference]: Without dead ends: 196 [2018-04-10 16:17:51,929 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-10 16:17:51,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-04-10 16:17:51,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 138. [2018-04-10 16:17:51,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-04-10 16:17:51,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 154 transitions. [2018-04-10 16:17:51,931 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 154 transitions. Word has length 25 [2018-04-10 16:17:51,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:17:51,931 INFO L459 AbstractCegarLoop]: Abstraction has 138 states and 154 transitions. [2018-04-10 16:17:51,931 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:17:51,932 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 154 transitions. [2018-04-10 16:17:51,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-04-10 16:17:51,932 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:17:51,932 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:17:51,932 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:17:51,933 INFO L82 PathProgramCache]: Analyzing trace with hash 667065395, now seen corresponding path program 1 times [2018-04-10 16:17:51,933 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:17:51,933 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:17:51,934 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:17:51,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:17:51,934 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:17:51,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:17:51,939 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:17:51,968 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-10 16:17:51,969 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:17:51,969 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-10 16:17:51,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 16:17:51,969 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 16:17:51,969 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-10 16:17:51,969 INFO L87 Difference]: Start difference. First operand 138 states and 154 transitions. Second operand 6 states. [2018-04-10 16:17:52,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:17:52,101 INFO L93 Difference]: Finished difference Result 206 states and 226 transitions. [2018-04-10 16:17:52,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-10 16:17:52,101 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-04-10 16:17:52,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:17:52,101 INFO L225 Difference]: With dead ends: 206 [2018-04-10 16:17:52,102 INFO L226 Difference]: Without dead ends: 206 [2018-04-10 16:17:52,102 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-04-10 16:17:52,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-04-10 16:17:52,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 151. [2018-04-10 16:17:52,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-04-10 16:17:52,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 171 transitions. [2018-04-10 16:17:52,104 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 171 transitions. Word has length 27 [2018-04-10 16:17:52,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:17:52,104 INFO L459 AbstractCegarLoop]: Abstraction has 151 states and 171 transitions. [2018-04-10 16:17:52,104 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 16:17:52,104 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 171 transitions. [2018-04-10 16:17:52,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-10 16:17:52,104 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:17:52,105 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:17:52,105 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:17:52,105 INFO L82 PathProgramCache]: Analyzing trace with hash -2018605973, now seen corresponding path program 1 times [2018-04-10 16:17:52,105 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:17:52,105 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:17:52,106 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:17:52,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:17:52,106 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:17:52,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:17:52,112 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:17:52,115 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:17:52,115 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:17:52,115 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:17:52,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:17:52,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:17:52,131 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:17:52,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-10 16:17:52,157 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-10 16:17:52,157 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:17:52,159 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:17:52,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:17:52,162 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-04-10 16:17:52,180 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-10 16:17:52,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-10 16:17:52,182 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:17:52,183 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:17:52,183 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:17:52,184 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-04-10 16:17:52,188 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-10 16:17:52,188 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:17:52,188 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-10 16:17:52,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-10 16:17:52,189 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-10 16:17:52,189 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-10 16:17:52,189 INFO L87 Difference]: Start difference. First operand 151 states and 171 transitions. Second operand 9 states. [2018-04-10 16:17:52,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:17:52,324 INFO L93 Difference]: Finished difference Result 196 states and 217 transitions. [2018-04-10 16:17:52,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-10 16:17:52,324 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-04-10 16:17:52,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:17:52,325 INFO L225 Difference]: With dead ends: 196 [2018-04-10 16:17:52,325 INFO L226 Difference]: Without dead ends: 196 [2018-04-10 16:17:52,325 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=116, Invalid=226, Unknown=0, NotChecked=0, Total=342 [2018-04-10 16:17:52,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-04-10 16:17:52,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 155. [2018-04-10 16:17:52,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-04-10 16:17:52,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 175 transitions. [2018-04-10 16:17:52,328 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 175 transitions. Word has length 30 [2018-04-10 16:17:52,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:17:52,329 INFO L459 AbstractCegarLoop]: Abstraction has 155 states and 175 transitions. [2018-04-10 16:17:52,329 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-10 16:17:52,329 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 175 transitions. [2018-04-10 16:17:52,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-10 16:17:52,329 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:17:52,329 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:17:52,330 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:17:52,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1797163218, now seen corresponding path program 1 times [2018-04-10 16:17:52,330 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:17:52,330 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:17:52,331 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:17:52,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:17:52,331 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:17:52,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:17:52,337 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:17:52,340 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:17:52,341 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:17:52,341 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:17:52,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:17:52,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:17:52,362 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:17:52,377 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:17:52,377 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:17:52,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-10 16:17:52,378 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:17:52,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:17:52,384 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-04-10 16:17:52,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:17:52,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:17:52,406 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:17:52,407 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:17:52,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:17:52,415 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-04-10 16:17:52,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-04-10 16:17:52,431 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:17:52,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 33 [2018-04-10 16:17:52,433 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:17:52,440 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:17:52,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:17:52,447 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2018-04-10 16:17:52,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2018-04-10 16:17:52,507 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:17:52,507 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:17:52,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2018-04-10 16:17:52,510 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:17:52,515 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:17:52,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:17:52,523 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:51, output treesize:15 [2018-04-10 16:17:52,550 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-10 16:17:52,550 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:17:52,550 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-10 16:17:52,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-10 16:17:52,551 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-10 16:17:52,551 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-04-10 16:17:52,551 INFO L87 Difference]: Start difference. First operand 155 states and 175 transitions. Second operand 11 states. [2018-04-10 16:17:52,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:17:52,933 INFO L93 Difference]: Finished difference Result 185 states and 206 transitions. [2018-04-10 16:17:52,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-10 16:17:52,933 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 31 [2018-04-10 16:17:52,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:17:52,934 INFO L225 Difference]: With dead ends: 185 [2018-04-10 16:17:52,934 INFO L226 Difference]: Without dead ends: 185 [2018-04-10 16:17:52,934 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2018-04-10 16:17:52,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-04-10 16:17:52,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 160. [2018-04-10 16:17:52,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-04-10 16:17:52,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 182 transitions. [2018-04-10 16:17:52,936 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 182 transitions. Word has length 31 [2018-04-10 16:17:52,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:17:52,937 INFO L459 AbstractCegarLoop]: Abstraction has 160 states and 182 transitions. [2018-04-10 16:17:52,937 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-10 16:17:52,937 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 182 transitions. [2018-04-10 16:17:52,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-10 16:17:52,937 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:17:52,937 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:17:52,937 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:17:52,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1797163219, now seen corresponding path program 1 times [2018-04-10 16:17:52,937 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:17:52,937 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:17:52,938 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:17:52,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:17:52,938 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:17:52,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:17:52,943 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:17:52,947 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:17:52,947 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:17:52,947 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:17:52,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:17:52,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:17:52,965 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:17:52,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:17:52,989 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:17:52,993 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:17:52,993 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:17:53,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-10 16:17:53,016 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:17:53,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:17:53,022 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2018-04-10 16:17:53,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:17:53,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:17:53,049 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:17:53,051 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:17:53,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:17:53,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:17:53,068 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:17:53,069 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:17:53,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:17:53,082 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:45, output treesize:35 [2018-04-10 16:17:53,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-04-10 16:17:53,104 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:17:53,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 25 [2018-04-10 16:17:53,107 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:17:53,112 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:17:53,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 28 treesize of output 21 [2018-04-10 16:17:53,132 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:17:53,132 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:17:53,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 37 [2018-04-10 16:17:53,133 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:17:53,140 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:17:53,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:17:53,152 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:61, output treesize:53 [2018-04-10 16:17:53,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2018-04-10 16:17:53,224 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:17:53,224 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:17:53,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2018-04-10 16:17:53,227 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:17:53,233 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:17:53,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2018-04-10 16:17:53,253 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:17:53,253 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:17:53,254 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:17:53,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-04-10 16:17:53,255 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:17:53,261 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:17:53,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:17:53,270 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:73, output treesize:14 [2018-04-10 16:17:53,301 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-10 16:17:53,302 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:17:53,302 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-04-10 16:17:53,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-10 16:17:53,303 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-10 16:17:53,303 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-04-10 16:17:53,303 INFO L87 Difference]: Start difference. First operand 160 states and 182 transitions. Second operand 13 states. [2018-04-10 16:17:54,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:17:54,005 INFO L93 Difference]: Finished difference Result 211 states and 230 transitions. [2018-04-10 16:17:54,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-10 16:17:54,008 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2018-04-10 16:17:54,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:17:54,010 INFO L225 Difference]: With dead ends: 211 [2018-04-10 16:17:54,010 INFO L226 Difference]: Without dead ends: 211 [2018-04-10 16:17:54,010 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=188, Invalid=412, Unknown=0, NotChecked=0, Total=600 [2018-04-10 16:17:54,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-04-10 16:17:54,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 162. [2018-04-10 16:17:54,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-04-10 16:17:54,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 183 transitions. [2018-04-10 16:17:54,014 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 183 transitions. Word has length 31 [2018-04-10 16:17:54,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:17:54,014 INFO L459 AbstractCegarLoop]: Abstraction has 162 states and 183 transitions. [2018-04-10 16:17:54,014 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-10 16:17:54,014 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 183 transitions. [2018-04-10 16:17:54,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-10 16:17:54,015 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:17:54,015 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:17:54,015 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:17:54,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1604260488, now seen corresponding path program 1 times [2018-04-10 16:17:54,015 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:17:54,015 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:17:54,016 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:17:54,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:17:54,016 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:17:54,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:17:54,026 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:17:54,131 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-10 16:17:54,132 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:17:54,132 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-10 16:17:54,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-10 16:17:54,132 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-10 16:17:54,132 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-04-10 16:17:54,133 INFO L87 Difference]: Start difference. First operand 162 states and 183 transitions. Second operand 9 states. [2018-04-10 16:17:54,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:17:54,338 INFO L93 Difference]: Finished difference Result 226 states and 246 transitions. [2018-04-10 16:17:54,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-10 16:17:54,338 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-04-10 16:17:54,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:17:54,339 INFO L225 Difference]: With dead ends: 226 [2018-04-10 16:17:54,339 INFO L226 Difference]: Without dead ends: 226 [2018-04-10 16:17:54,339 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2018-04-10 16:17:54,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-04-10 16:17:54,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 169. [2018-04-10 16:17:54,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-04-10 16:17:54,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 192 transitions. [2018-04-10 16:17:54,342 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 192 transitions. Word has length 34 [2018-04-10 16:17:54,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:17:54,342 INFO L459 AbstractCegarLoop]: Abstraction has 169 states and 192 transitions. [2018-04-10 16:17:54,342 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-10 16:17:54,342 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 192 transitions. [2018-04-10 16:17:54,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-10 16:17:54,343 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:17:54,343 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:17:54,343 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:17:54,343 INFO L82 PathProgramCache]: Analyzing trace with hash 777452042, now seen corresponding path program 1 times [2018-04-10 16:17:54,343 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:17:54,343 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:17:54,344 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:17:54,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:17:54,344 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:17:54,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:17:54,354 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:17:54,358 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:17:54,358 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:17:54,358 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:17:54,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:17:54,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:17:54,394 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:17:54,406 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:17:54,407 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:17:54,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-10 16:17:54,408 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:17:54,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:17:54,417 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-04-10 16:17:54,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:17:54,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:17:54,428 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:17:54,431 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:17:54,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:17:54,437 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2018-04-10 16:17:54,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2018-04-10 16:17:54,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:17:54,461 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:17:54,466 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:17:54,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:17:54,472 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2018-04-10 16:17:54,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2018-04-10 16:17:54,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-04-10 16:17:54,498 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:17:54,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 16:17:54,504 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:17:54,506 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:17:54,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:17:54,511 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:43, output treesize:15 [2018-04-10 16:17:54,534 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:17:54,534 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:17:54,534 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-10 16:17:54,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-10 16:17:54,535 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-10 16:17:54,535 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-04-10 16:17:54,535 INFO L87 Difference]: Start difference. First operand 169 states and 192 transitions. Second operand 9 states. [2018-04-10 16:17:54,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:17:54,835 INFO L93 Difference]: Finished difference Result 178 states and 203 transitions. [2018-04-10 16:17:54,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-10 16:17:54,835 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-04-10 16:17:54,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:17:54,836 INFO L225 Difference]: With dead ends: 178 [2018-04-10 16:17:54,836 INFO L226 Difference]: Without dead ends: 178 [2018-04-10 16:17:54,837 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2018-04-10 16:17:54,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-04-10 16:17:54,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 160. [2018-04-10 16:17:54,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-04-10 16:17:54,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 183 transitions. [2018-04-10 16:17:54,840 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 183 transitions. Word has length 34 [2018-04-10 16:17:54,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:17:54,840 INFO L459 AbstractCegarLoop]: Abstraction has 160 states and 183 transitions. [2018-04-10 16:17:54,840 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-10 16:17:54,840 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 183 transitions. [2018-04-10 16:17:54,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-10 16:17:54,840 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:17:54,840 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:17:54,841 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:17:54,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1756971365, now seen corresponding path program 1 times [2018-04-10 16:17:54,841 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:17:54,841 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:17:54,842 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:17:54,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:17:54,842 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:17:54,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:17:54,848 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:17:54,937 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-10 16:17:54,937 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:17:54,937 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-04-10 16:17:54,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-10 16:17:54,938 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-10 16:17:54,938 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-04-10 16:17:54,938 INFO L87 Difference]: Start difference. First operand 160 states and 183 transitions. Second operand 11 states. [2018-04-10 16:17:55,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:17:55,270 INFO L93 Difference]: Finished difference Result 211 states and 229 transitions. [2018-04-10 16:17:55,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-10 16:17:55,271 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2018-04-10 16:17:55,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:17:55,272 INFO L225 Difference]: With dead ends: 211 [2018-04-10 16:17:55,272 INFO L226 Difference]: Without dead ends: 211 [2018-04-10 16:17:55,272 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2018-04-10 16:17:55,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-04-10 16:17:55,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 168. [2018-04-10 16:17:55,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-04-10 16:17:55,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 191 transitions. [2018-04-10 16:17:55,275 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 191 transitions. Word has length 35 [2018-04-10 16:17:55,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:17:55,275 INFO L459 AbstractCegarLoop]: Abstraction has 168 states and 191 transitions. [2018-04-10 16:17:55,275 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-10 16:17:55,275 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 191 transitions. [2018-04-10 16:17:55,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-10 16:17:55,276 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:17:55,276 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:17:55,276 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:17:55,276 INFO L82 PathProgramCache]: Analyzing trace with hash 854380635, now seen corresponding path program 1 times [2018-04-10 16:17:55,276 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:17:55,276 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:17:55,277 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:17:55,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:17:55,277 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:17:55,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:17:55,283 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:17:55,303 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-10 16:17:55,304 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:17:55,304 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 16:17:55,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:17:55,304 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:17:55,304 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:17:55,304 INFO L87 Difference]: Start difference. First operand 168 states and 191 transitions. Second operand 5 states. [2018-04-10 16:17:55,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:17:55,385 INFO L93 Difference]: Finished difference Result 204 states and 228 transitions. [2018-04-10 16:17:55,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-10 16:17:55,385 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-04-10 16:17:55,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:17:55,386 INFO L225 Difference]: With dead ends: 204 [2018-04-10 16:17:55,386 INFO L226 Difference]: Without dead ends: 204 [2018-04-10 16:17:55,386 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-10 16:17:55,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-04-10 16:17:55,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 177. [2018-04-10 16:17:55,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-04-10 16:17:55,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 204 transitions. [2018-04-10 16:17:55,389 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 204 transitions. Word has length 35 [2018-04-10 16:17:55,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:17:55,390 INFO L459 AbstractCegarLoop]: Abstraction has 177 states and 204 transitions. [2018-04-10 16:17:55,390 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:17:55,390 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 204 transitions. [2018-04-10 16:17:55,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-10 16:17:55,390 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:17:55,390 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:17:55,391 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:17:55,391 INFO L82 PathProgramCache]: Analyzing trace with hash 287564991, now seen corresponding path program 1 times [2018-04-10 16:17:55,391 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:17:55,391 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:17:55,392 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:17:55,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:17:55,392 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:17:55,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:17:55,400 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:17:55,403 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:17:55,403 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:17:55,403 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:17:55,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:17:55,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:17:55,429 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:17:55,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:17:55,448 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:17:55,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:17:55,454 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-04-10 16:17:55,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:17:55,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 8 treesize of output 7 [2018-04-10 16:17:55,470 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:17:55,472 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:17:55,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 11 treesize of output 8 [2018-04-10 16:17:55,488 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:17:55,488 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:17:55,490 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:17:55,500 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:17:55,500 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2018-04-10 16:17:55,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-10 16:17:55,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-10 16:17:55,519 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:17:55,521 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:17:55,528 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:17:55,529 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:25 [2018-04-10 16:17:55,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 35 [2018-04-10 16:17:55,561 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:17:55,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 28 [2018-04-10 16:17:55,563 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:17:55,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 20 treesize of output 19 [2018-04-10 16:17:55,579 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:17:55,585 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:17:55,595 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-10 16:17:55,595 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:35, output treesize:31 [2018-04-10 16:17:55,621 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:17:55,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:17:55,624 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:17:55,627 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:17:55,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 30 treesize of output 57 [2018-04-10 16:17:55,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 40 [2018-04-10 16:17:55,688 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 16:17:55,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-04-10 16:17:55,755 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:17:55,802 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:17:55,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 29 treesize of output 51 [2018-04-10 16:17:55,816 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-04-10 16:17:55,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 35 [2018-04-10 16:17:55,925 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-04-10 16:17:55,966 INFO L267 ElimStorePlain]: Start of recursive call 4: 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2018-04-10 16:17:56,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 19 dim-0 vars, and 5 xjuncts. [2018-04-10 16:17:56,023 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:53, output treesize:220 [2018-04-10 16:17:58,229 WARN L151 SmtUtils]: Spent 2179ms on a formula simplification. DAG size of input: 128 DAG size of output 107 [2018-04-10 16:18:02,383 WARN L148 SmtUtils]: Spent 4093ms on a formula simplification that was a NOOP. DAG size: 107 [2018-04-10 16:18:02,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 72 [2018-04-10 16:18:02,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 63 [2018-04-10 16:18:02,411 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:18:02,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 58 [2018-04-10 16:18:02,444 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:18:02,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 56 [2018-04-10 16:18:02,496 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-10 16:18:02,533 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-10 16:18:02,607 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 58 [2018-04-10 16:18:02,609 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:18:02,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-10 16:18:02,610 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:18:02,620 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:18:02,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 58 treesize of output 54 [2018-04-10 16:18:02,695 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:18:02,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-10 16:18:02,696 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 16:18:02,704 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:18:02,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 61 [2018-04-10 16:18:02,783 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:18:02,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 47 [2018-04-10 16:18:02,784 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-10 16:18:02,845 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:18:02,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 15 dim-0 vars, 4 dim-2 vars, End of recursive call: 23 dim-0 vars, and 6 xjuncts. [2018-04-10 16:18:02,912 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 19 variables, input treesize:240, output treesize:289 [2018-04-10 16:18:03,467 WARN L151 SmtUtils]: Spent 520ms on a formula simplification. DAG size of input: 139 DAG size of output 115 [2018-04-10 16:18:03,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 43 [2018-04-10 16:18:03,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 32 [2018-04-10 16:18:03,617 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:18:03,640 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:18:03,641 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:18:03,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2018-04-10 16:18:03,643 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:18:03,658 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:18:03,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 64 [2018-04-10 16:18:03,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 40 [2018-04-10 16:18:03,696 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:18:03,738 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:18:03,738 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:18:03,739 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:18:03,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 44 [2018-04-10 16:18:03,740 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:18:03,796 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:18:03,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2018-04-10 16:18:03,797 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 16:18:03,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2018-04-10 16:18:03,824 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-04-10 16:18:03,889 INFO L267 ElimStorePlain]: Start of recursive call 5: 8 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-10 16:18:03,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 68 [2018-04-10 16:18:03,948 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:18:03,958 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:18:03,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2018-04-10 16:18:03,960 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-10 16:18:04,044 INFO L267 ElimStorePlain]: Start of recursive call 10: 13 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:18:04,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 17 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:18:04,075 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 20 variables, input treesize:158, output treesize:5 [2018-04-10 16:18:04,109 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:18:04,110 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:18:04,110 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-10 16:18:04,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-10 16:18:04,110 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-10 16:18:04,110 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-04-10 16:18:04,110 INFO L87 Difference]: Start difference. First operand 177 states and 204 transitions. Second operand 15 states. [2018-04-10 16:18:06,520 WARN L151 SmtUtils]: Spent 1975ms on a formula simplification. DAG size of input: 112 DAG size of output 104 [2018-04-10 16:18:16,981 WARN L151 SmtUtils]: Spent 10350ms on a formula simplification. DAG size of input: 166 DAG size of output 113 [2018-04-10 16:18:39,318 WARN L151 SmtUtils]: Spent 22237ms on a formula simplification. DAG size of input: 233 DAG size of output 158 [2018-04-10 16:18:40,153 WARN L148 SmtUtils]: Spent 798ms on a formula simplification that was a NOOP. DAG size: 110 [2018-04-10 16:18:51,415 WARN L151 SmtUtils]: Spent 11191ms on a formula simplification. DAG size of input: 168 DAG size of output 107 [2018-04-10 16:19:15,320 WARN L151 SmtUtils]: Spent 23854ms on a formula simplification. DAG size of input: 225 DAG size of output 96 [2018-04-10 16:19:49,648 WARN L151 SmtUtils]: Spent 34212ms on a formula simplification. DAG size of input: 228 DAG size of output 99 [2018-04-10 16:19:50,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:19:50,147 INFO L93 Difference]: Finished difference Result 251 states and 278 transitions. [2018-04-10 16:19:50,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-10 16:19:50,148 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 36 [2018-04-10 16:19:50,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:19:50,148 INFO L225 Difference]: With dead ends: 251 [2018-04-10 16:19:50,148 INFO L226 Difference]: Without dead ends: 251 [2018-04-10 16:19:50,149 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 112.1s TimeCoverageRelationStatistics Valid=257, Invalid=865, Unknown=0, NotChecked=0, Total=1122 [2018-04-10 16:19:50,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-04-10 16:19:50,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 199. [2018-04-10 16:19:50,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-04-10 16:19:50,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 231 transitions. [2018-04-10 16:19:50,152 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 231 transitions. Word has length 36 [2018-04-10 16:19:50,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:19:50,152 INFO L459 AbstractCegarLoop]: Abstraction has 199 states and 231 transitions. [2018-04-10 16:19:50,152 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-10 16:19:50,152 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 231 transitions. [2018-04-10 16:19:50,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-10 16:19:50,153 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:19:50,153 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:19:50,153 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:19:50,153 INFO L82 PathProgramCache]: Analyzing trace with hash 287564992, now seen corresponding path program 1 times [2018-04-10 16:19:50,153 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:19:50,153 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:19:50,154 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:19:50,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:19:50,155 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:19:50,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:19:50,163 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:19:50,167 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:19:50,168 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:19:50,168 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:19:50,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:19:50,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:19:50,201 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:19:50,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:19:50,204 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:19:50,223 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:19:50,223 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:19:50,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:19:50,239 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:19:50,248 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:19:50,248 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:19:50,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-10 16:19:50,249 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:19:50,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:19:50,255 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-04-10 16:19:50,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:19:50,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:19:50,269 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:19:50,270 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:19:50,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:19:50,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:19:50,282 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:19:50,283 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:19:50,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:19:50,291 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:44, output treesize:34 [2018-04-10 16:19:50,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-04-10 16:19:50,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:19:50,324 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:19:50,329 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:19:50,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 56 [2018-04-10 16:19:50,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:19:50,346 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:19:50,352 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:19:50,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:19:50,363 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:83, output treesize:67 [2018-04-10 16:19:50,478 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 79 [2018-04-10 16:19:50,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 64 treesize of output 63 [2018-04-10 16:19:50,486 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:19:50,583 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:19:50,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2018-04-10 16:19:50,585 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:19:50,709 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-10 16:19:50,762 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:19:50,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 102 [2018-04-10 16:19:50,769 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:19:50,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2018-04-10 16:19:50,770 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:19:50,789 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:19:50,795 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:19:50,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 72 [2018-04-10 16:19:50,798 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:19:50,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 50 [2018-04-10 16:19:50,800 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 16:19:50,815 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:19:50,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 114 [2018-04-10 16:19:50,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 91 [2018-04-10 16:19:50,852 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 16:19:50,936 INFO L267 ElimStorePlain]: Start of recursive call 9: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:19:50,978 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2018-04-10 16:19:50,979 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:93, output treesize:240 [2018-04-10 16:19:51,312 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:19:51,314 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:19:51,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 69 [2018-04-10 16:19:51,350 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 67 [2018-04-10 16:19:51,351 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 16:19:51,380 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:19:51,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2018-04-10 16:19:51,382 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:19:51,401 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:19:51,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 30 [2018-04-10 16:19:51,402 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:19:51,421 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:19:51,438 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 49 [2018-04-10 16:19:51,439 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:19:51,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2018-04-10 16:19:51,440 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:19:51,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2018-04-10 16:19:51,457 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 16:19:51,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-04-10 16:19:51,469 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 16:19:51,480 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:19:51,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 0 case distinctions, treesize of input 33 treesize of output 25 [2018-04-10 16:19:51,481 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 16:19:51,493 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:19:51,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, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-04-10 16:19:51,494 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-10 16:19:51,503 INFO L267 ElimStorePlain]: Start of recursive call 6: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:19:51,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:19:51,514 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 7 variables, input treesize:110, output treesize:16 [2018-04-10 16:19:51,560 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:19:51,561 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:19:51,561 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-10 16:19:51,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-10 16:19:51,561 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-10 16:19:51,561 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2018-04-10 16:19:51,562 INFO L87 Difference]: Start difference. First operand 199 states and 231 transitions. Second operand 17 states. [2018-04-10 16:19:53,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:19:53,273 INFO L93 Difference]: Finished difference Result 280 states and 310 transitions. [2018-04-10 16:19:53,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-10 16:19:53,274 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2018-04-10 16:19:53,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:19:53,274 INFO L225 Difference]: With dead ends: 280 [2018-04-10 16:19:53,275 INFO L226 Difference]: Without dead ends: 280 [2018-04-10 16:19:53,275 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=209, Invalid=846, Unknown=1, NotChecked=0, Total=1056 [2018-04-10 16:19:53,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-04-10 16:19:53,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 216. [2018-04-10 16:19:53,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-04-10 16:19:53,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 252 transitions. [2018-04-10 16:19:53,277 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 252 transitions. Word has length 36 [2018-04-10 16:19:53,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:19:53,277 INFO L459 AbstractCegarLoop]: Abstraction has 216 states and 252 transitions. [2018-04-10 16:19:53,277 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-10 16:19:53,277 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 252 transitions. [2018-04-10 16:19:53,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-10 16:19:53,278 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:19:53,278 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:19:53,278 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:19:53,278 INFO L82 PathProgramCache]: Analyzing trace with hash -585558576, now seen corresponding path program 1 times [2018-04-10 16:19:53,278 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:19:53,278 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:19:53,279 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:19:53,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:19:53,279 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:19:53,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:19:53,287 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:19:53,290 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:19:53,290 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:19:53,290 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:19:53,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:19:53,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:19:53,313 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:19:53,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:19:53,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 8 treesize of output 7 [2018-04-10 16:19:53,328 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:19:53,330 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:19:53,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:19:53,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:19:53,342 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:19:53,344 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:19:53,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:19:53,352 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-04-10 16:19:53,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-10 16:19:53,369 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:19:53,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 16:19:53,370 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:19:53,375 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:19:53,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 21 treesize of output 16 [2018-04-10 16:19:53,389 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:19:53,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 16:19:53,390 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:19:53,394 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:19:53,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:19:53,401 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:52, output treesize:44 [2018-04-10 16:19:53,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-10 16:19:53,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-10 16:19:53,414 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:19:53,415 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:19:53,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:19:53,424 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:53 [2018-04-10 16:19:53,447 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:19:53,448 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:19:53,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-10 16:19:53,449 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:19:53,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:19:53,460 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:61, output treesize:55 [2018-04-10 16:19:53,489 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-04-10 16:19:53,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 16:19:53,491 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:19:53,492 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:19:53,500 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:19:53,500 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:55, output treesize:46 [2018-04-10 16:19:53,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-04-10 16:19:53,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:19:53,524 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:19:53,543 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:19:53,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 37 [2018-04-10 16:19:53,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 8 treesize of output 7 [2018-04-10 16:19:53,558 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:19:53,563 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:19:53,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:19:53,576 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:71, output treesize:90 [2018-04-10 16:19:53,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 74 [2018-04-10 16:19:53,602 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:19:53,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 88 [2018-04-10 16:19:53,604 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:19:53,614 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:19:53,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 85 [2018-04-10 16:19:53,636 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:19:53,636 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:19:53,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 101 [2018-04-10 16:19:53,637 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:19:53,648 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:19:53,662 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:19:53,662 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:116, output treesize:108 [2018-04-10 16:19:53,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 16:19:53,781 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:19:53,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 16:19:53,795 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:126, output treesize:121 [2018-04-10 16:19:53,798 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:19:53,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 94 [2018-04-10 16:19:53,802 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:19:53,803 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:19:53,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2018-04-10 16:19:53,803 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:19:53,818 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:19:53,818 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:19:53,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 47 [2018-04-10 16:19:53,821 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:19:53,826 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:19:53,836 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 43 [2018-04-10 16:19:53,838 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:19:53,838 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:19:53,838 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:19:53,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 31 [2018-04-10 16:19:53,839 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:19:53,846 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:19:53,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-04-10 16:19:53,846 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:19:53,848 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:19:53,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:19:53,852 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:137, output treesize:7 [2018-04-10 16:19:53,881 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:19:53,881 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:19:53,881 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-10 16:19:53,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-10 16:19:53,881 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-10 16:19:53,881 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=257, Unknown=3, NotChecked=0, Total=306 [2018-04-10 16:19:53,881 INFO L87 Difference]: Start difference. First operand 216 states and 252 transitions. Second operand 18 states. [2018-04-10 16:19:54,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:19:54,965 INFO L93 Difference]: Finished difference Result 257 states and 291 transitions. [2018-04-10 16:19:54,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-10 16:19:54,965 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 37 [2018-04-10 16:19:54,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:19:54,966 INFO L225 Difference]: With dead ends: 257 [2018-04-10 16:19:54,966 INFO L226 Difference]: Without dead ends: 257 [2018-04-10 16:19:54,967 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=228, Invalid=1023, Unknown=9, NotChecked=0, Total=1260 [2018-04-10 16:19:54,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-04-10 16:19:54,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 236. [2018-04-10 16:19:54,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-04-10 16:19:54,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 273 transitions. [2018-04-10 16:19:54,969 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 273 transitions. Word has length 37 [2018-04-10 16:19:54,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:19:54,969 INFO L459 AbstractCegarLoop]: Abstraction has 236 states and 273 transitions. [2018-04-10 16:19:54,969 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-10 16:19:54,969 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 273 transitions. [2018-04-10 16:19:54,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-10 16:19:54,969 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:19:54,969 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:19:54,970 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:19:54,970 INFO L82 PathProgramCache]: Analyzing trace with hash -58521746, now seen corresponding path program 1 times [2018-04-10 16:19:54,970 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:19:54,970 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:19:54,970 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:19:54,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:19:54,971 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:19:54,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:19:54,975 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:19:54,998 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-10 16:19:54,998 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:19:54,998 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 16:19:54,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:19:54,999 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:19:54,999 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:19:54,999 INFO L87 Difference]: Start difference. First operand 236 states and 273 transitions. Second operand 5 states. [2018-04-10 16:19:55,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:19:55,067 INFO L93 Difference]: Finished difference Result 257 states and 286 transitions. [2018-04-10 16:19:55,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 16:19:55,067 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-04-10 16:19:55,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:19:55,068 INFO L225 Difference]: With dead ends: 257 [2018-04-10 16:19:55,068 INFO L226 Difference]: Without dead ends: 257 [2018-04-10 16:19:55,068 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-10 16:19:55,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-04-10 16:19:55,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 225. [2018-04-10 16:19:55,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-04-10 16:19:55,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 257 transitions. [2018-04-10 16:19:55,072 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 257 transitions. Word has length 39 [2018-04-10 16:19:55,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:19:55,073 INFO L459 AbstractCegarLoop]: Abstraction has 225 states and 257 transitions. [2018-04-10 16:19:55,073 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:19:55,073 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 257 transitions. [2018-04-10 16:19:55,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-10 16:19:55,073 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:19:55,073 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:19:55,073 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:19:55,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1377853024, now seen corresponding path program 1 times [2018-04-10 16:19:55,074 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:19:55,074 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:19:55,075 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:19:55,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:19:55,075 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:19:55,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:19:55,085 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:19:55,088 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:19:55,088 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:19:55,088 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:19:55,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:19:55,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:19:55,149 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:19:55,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:19:55,155 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:19:55,158 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:19:55,158 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:19:55,180 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-10 16:19:55,180 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:19:55,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 6 treesize of output 5 [2018-04-10 16:19:55,190 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:19:55,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:19:55,197 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:28 [2018-04-10 16:19:55,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:19:55,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:19:55,214 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:19:55,215 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:19:55,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 11 treesize of output 8 [2018-04-10 16:19:55,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 8 treesize of output 7 [2018-04-10 16:19:55,230 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:19:55,232 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:19:55,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:19:55,244 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:43 [2018-04-10 16:19:55,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-10 16:19:55,259 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-10 16:19:55,260 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:19:55,261 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:19:55,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:19:55,268 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:39 [2018-04-10 16:19:55,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 42 [2018-04-10 16:19:55,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2018-04-10 16:19:55,290 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:19:55,306 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:19:55,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-10 16:19:55,313 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2018-04-10 16:19:55,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 32 [2018-04-10 16:19:55,341 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-10 16:19:55,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-04-10 16:19:55,352 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:84 [2018-04-10 16:19:55,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 74 treesize of output 88 [2018-04-10 16:19:55,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 78 [2018-04-10 16:19:55,400 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:19:55,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 73 [2018-04-10 16:19:55,453 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-10 16:19:55,498 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:19:55,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 57 [2018-04-10 16:19:55,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:19:55,553 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:19:55,563 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:19:55,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 67 [2018-04-10 16:19:55,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:19:55,567 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 16:19:55,578 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:19:55,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 56 [2018-04-10 16:19:55,582 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:19:55,582 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 16:19:55,593 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:19:55,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 55 treesize of output 82 [2018-04-10 16:19:55,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 60 treesize of output 59 [2018-04-10 16:19:55,657 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-10 16:19:55,730 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:19:55,731 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 57 [2018-04-10 16:19:55,731 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:19:55,792 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:19:55,792 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:19:55,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 68 [2018-04-10 16:19:55,795 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:19:55,900 INFO L267 ElimStorePlain]: Start of recursive call 11: 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-04-10 16:19:55,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 3 dim-2 vars, End of recursive call: 24 dim-0 vars, and 6 xjuncts. [2018-04-10 16:19:55,983 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 11 variables, input treesize:134, output treesize:310 [2018-04-10 16:20:08,162 WARN L151 SmtUtils]: Spent 12149ms on a formula simplification. DAG size of input: 163 DAG size of output 140 [2018-04-10 16:20:08,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 88 [2018-04-10 16:20:08,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 16:20:08,383 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:08,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 16:20:08,399 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:08,411 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:20:08,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 68 [2018-04-10 16:20:08,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2018-04-10 16:20:08,482 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:20:08,492 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:20:08,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-10 16:20:08,492 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:08,501 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:20:08,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 88 [2018-04-10 16:20:08,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 61 [2018-04-10 16:20:08,616 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:20:08,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 72 [2018-04-10 16:20:08,757 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:08,891 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:20:08,891 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 69 [2018-04-10 16:20:08,892 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:09,020 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:20:09,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 52 [2018-04-10 16:20:09,022 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:20:09,160 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:20:09,160 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:20:09,161 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:20:09,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 69 [2018-04-10 16:20:09,163 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:20:09,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 46 [2018-04-10 16:20:09,300 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:09,414 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:20:09,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 68 [2018-04-10 16:20:09,415 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:09,540 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:20:09,540 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:20:09,541 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:20:09,541 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:20:09,541 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:20:09,543 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 68 [2018-04-10 16:20:09,544 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:20:09,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 50 [2018-04-10 16:20:09,668 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:20:09,779 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:20:09,779 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:20:09,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 58 [2018-04-10 16:20:09,780 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:09,889 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:20:09,890 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:20:09,891 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:20:09,891 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:20:09,891 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:20:09,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 72 [2018-04-10 16:20:09,894 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:20:10,017 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:20:10,018 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:20:10,018 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:20:10,019 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:20:10,019 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:20:10,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 72 [2018-04-10 16:20:10,021 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:20:10,130 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:20:10,131 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:20:10,131 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:20:10,132 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:20:10,132 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:20:10,134 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 72 [2018-04-10 16:20:10,134 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:20:10,232 INFO L267 ElimStorePlain]: Start of recursive call 8: 13 dim-1 vars, End of recursive call: 8 dim-0 vars, and 8 xjuncts. [2018-04-10 16:20:10,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 46 [2018-04-10 16:20:10,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2018-04-10 16:20:10,397 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:10,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2018-04-10 16:20:10,419 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:10,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2018-04-10 16:20:10,439 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:10,457 INFO L267 ElimStorePlain]: Start of recursive call 22: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:20:10,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2018-04-10 16:20:10,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 16:20:10,460 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:10,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 16:20:10,469 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:10,476 INFO L267 ElimStorePlain]: Start of recursive call 26: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:20:10,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 42 [2018-04-10 16:20:10,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2018-04-10 16:20:10,482 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:10,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2018-04-10 16:20:10,502 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:10,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-04-10 16:20:10,522 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:10,540 INFO L267 ElimStorePlain]: Start of recursive call 29: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:20:10,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 50 [2018-04-10 16:20:10,546 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 41 [2018-04-10 16:20:10,546 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:10,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2018-04-10 16:20:10,573 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:10,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 35 [2018-04-10 16:20:10,599 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:10,641 INFO L267 ElimStorePlain]: Start of recursive call 33: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:20:10,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2018-04-10 16:20:10,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 16:20:10,644 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:10,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 16:20:10,654 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:10,661 INFO L267 ElimStorePlain]: Start of recursive call 37: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:20:10,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2018-04-10 16:20:10,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 16:20:10,664 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:10,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 16:20:10,675 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:10,683 INFO L267 ElimStorePlain]: Start of recursive call 40: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:20:10,684 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2018-04-10 16:20:10,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 16:20:10,686 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:10,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 16:20:10,696 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:10,704 INFO L267 ElimStorePlain]: Start of recursive call 43: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:20:10,708 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 46 [2018-04-10 16:20:10,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2018-04-10 16:20:10,710 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:10,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2018-04-10 16:20:10,738 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:10,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2018-04-10 16:20:10,760 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:10,779 INFO L267 ElimStorePlain]: Start of recursive call 46: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:20:10,937 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 58 treesize of output 52 [2018-04-10 16:20:10,938 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:20:10,939 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:20:10,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-04-10 16:20:10,940 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:10,950 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:20:11,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2018-04-10 16:20:11,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-10 16:20:11,103 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:11,110 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:20:11,249 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 35 treesize of output 31 [2018-04-10 16:20:11,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-10 16:20:11,250 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:11,257 INFO L267 ElimStorePlain]: Start of recursive call 54: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:20:11,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 61 [2018-04-10 16:20:11,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 16:20:11,397 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:11,408 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:20:11,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-04-10 16:20:11,408 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:11,417 INFO L267 ElimStorePlain]: Start of recursive call 56: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:20:11,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2018-04-10 16:20:11,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 16:20:11,561 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:11,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 16:20:11,569 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:11,574 INFO L267 ElimStorePlain]: Start of recursive call 59: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:20:11,708 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 73 [2018-04-10 16:20:11,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 54 [2018-04-10 16:20:11,711 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:11,762 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:20:11,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 52 [2018-04-10 16:20:11,762 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:11,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 43 [2018-04-10 16:20:11,817 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 2 xjuncts. [2018-04-10 16:20:11,875 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 41 [2018-04-10 16:20:11,876 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:11,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 49 [2018-04-10 16:20:11,933 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:11,989 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:20:11,989 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:20:11,990 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:20:11,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 65 [2018-04-10 16:20:11,998 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 4 xjuncts. [2018-04-10 16:20:12,057 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:20:12,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2018-04-10 16:20:12,057 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:12,111 INFO L267 ElimStorePlain]: Start of recursive call 62: 8 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-10 16:20:12,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 27 dim-0 vars, 10 dim-2 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2018-04-10 16:20:12,253 INFO L202 ElimStorePlain]: Needed 69 recursive calls to eliminate 37 variables, input treesize:386, output treesize:51 [2018-04-10 16:20:12,327 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:20:12,328 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:20:12,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-10 16:20:12,329 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:12,343 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:20:12,344 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:20:12,345 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 23 treesize of output 30 [2018-04-10 16:20:12,345 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:12,357 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-10 16:20:12,358 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:41, output treesize:37 [2018-04-10 16:20:12,445 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:20:12,445 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:20:12,445 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-10 16:20:12,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-10 16:20:12,445 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-10 16:20:12,445 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2018-04-10 16:20:12,445 INFO L87 Difference]: Start difference. First operand 225 states and 257 transitions. Second operand 17 states. [2018-04-10 16:20:13,126 WARN L151 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 150 DAG size of output 150 [2018-04-10 16:20:13,385 WARN L151 SmtUtils]: Spent 150ms on a formula simplification. DAG size of input: 220 DAG size of output 152 [2018-04-10 16:20:13,716 WARN L151 SmtUtils]: Spent 168ms on a formula simplification. DAG size of input: 228 DAG size of output 160 [2018-04-10 16:20:13,974 WARN L151 SmtUtils]: Spent 159ms on a formula simplification. DAG size of input: 228 DAG size of output 156 [2018-04-10 16:20:14,232 WARN L151 SmtUtils]: Spent 171ms on a formula simplification. DAG size of input: 243 DAG size of output 170 [2018-04-10 16:20:15,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:20:15,219 INFO L93 Difference]: Finished difference Result 396 states and 435 transitions. [2018-04-10 16:20:15,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-10 16:20:15,220 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 40 [2018-04-10 16:20:15,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:20:15,221 INFO L225 Difference]: With dead ends: 396 [2018-04-10 16:20:15,221 INFO L226 Difference]: Without dead ends: 396 [2018-04-10 16:20:15,221 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=253, Invalid=1079, Unknown=0, NotChecked=0, Total=1332 [2018-04-10 16:20:15,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2018-04-10 16:20:15,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 236. [2018-04-10 16:20:15,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-04-10 16:20:15,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 271 transitions. [2018-04-10 16:20:15,224 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 271 transitions. Word has length 40 [2018-04-10 16:20:15,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:20:15,225 INFO L459 AbstractCegarLoop]: Abstraction has 236 states and 271 transitions. [2018-04-10 16:20:15,225 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-10 16:20:15,225 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 271 transitions. [2018-04-10 16:20:15,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-10 16:20:15,225 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:20:15,225 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:20:15,225 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:20:15,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1377853023, now seen corresponding path program 1 times [2018-04-10 16:20:15,226 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:20:15,226 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:20:15,227 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:20:15,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:20:15,227 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:20:15,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:20:15,237 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:20:15,241 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:20:15,241 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:20:15,241 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:20:15,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:20:15,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:20:15,281 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:20:15,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:20:15,314 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:15,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:20:15,320 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-04-10 16:20:15,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 11 treesize of output 8 [2018-04-10 16:20:15,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:20:15,337 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:15,339 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:20:15,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:20:15,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:20:15,352 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:15,354 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:20:15,362 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:20:15,363 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:37, output treesize:26 [2018-04-10 16:20:15,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 50 [2018-04-10 16:20:15,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 37 treesize of output 36 [2018-04-10 16:20:15,403 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:15,424 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:20:15,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 51 [2018-04-10 16:20:15,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 45 treesize of output 44 [2018-04-10 16:20:15,449 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:15,469 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:20:15,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:20:15,478 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:75, output treesize:59 [2018-04-10 16:20:15,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 60 [2018-04-10 16:20:15,548 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:20:15,548 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:20:15,549 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 73 [2018-04-10 16:20:15,549 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:15,572 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:20:15,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 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 65 [2018-04-10 16:20:15,595 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:20:15,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 72 [2018-04-10 16:20:15,596 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:15,615 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:20:15,615 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:20:15,616 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:20:15,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 47 [2018-04-10 16:20:15,617 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:15,629 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:20:15,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-04-10 16:20:15,644 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:101, output treesize:144 [2018-04-10 16:20:15,784 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 95 [2018-04-10 16:20:15,787 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:20:15,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 78 [2018-04-10 16:20:15,788 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:15,828 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:20:15,828 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:20:15,829 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:20:15,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 77 [2018-04-10 16:20:15,831 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:15,860 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:20:15,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 66 [2018-04-10 16:20:15,861 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:15,883 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:20:15,918 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 75 treesize of output 69 [2018-04-10 16:20:15,920 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:20:15,920 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:20:15,922 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-04-10 16:20:15,922 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:15,932 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:20:15,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 48 [2018-04-10 16:20:15,975 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:20:15,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-04-10 16:20:15,976 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:15,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-04-10 16:20:15,985 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:15,991 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:20:15,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 50 [2018-04-10 16:20:15,997 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:20:15,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2018-04-10 16:20:15,997 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:16,018 INFO L267 ElimStorePlain]: Start of recursive call 11: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:20:16,041 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 52 treesize of output 42 [2018-04-10 16:20:16,043 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:20:16,043 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:20:16,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-04-10 16:20:16,044 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:16,050 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:20:16,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-04-10 16:20:16,067 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 12 variables, input treesize:178, output treesize:37 [2018-04-10 16:20:16,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2018-04-10 16:20:16,108 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:16,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-04-10 16:20:16,117 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:16,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-10 16:20:16,125 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:34, output treesize:32 [2018-04-10 16:20:16,159 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:20:16,159 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:20:16,159 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-10 16:20:16,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-10 16:20:16,160 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-10 16:20:16,160 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=224, Unknown=1, NotChecked=0, Total=272 [2018-04-10 16:20:16,160 INFO L87 Difference]: Start difference. First operand 236 states and 271 transitions. Second operand 17 states. [2018-04-10 16:20:17,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:20:17,517 INFO L93 Difference]: Finished difference Result 373 states and 409 transitions. [2018-04-10 16:20:17,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-10 16:20:17,517 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 40 [2018-04-10 16:20:17,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:20:17,518 INFO L225 Difference]: With dead ends: 373 [2018-04-10 16:20:17,518 INFO L226 Difference]: Without dead ends: 373 [2018-04-10 16:20:17,518 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=231, Invalid=1028, Unknown=1, NotChecked=0, Total=1260 [2018-04-10 16:20:17,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2018-04-10 16:20:17,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 236. [2018-04-10 16:20:17,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-04-10 16:20:17,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 269 transitions. [2018-04-10 16:20:17,521 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 269 transitions. Word has length 40 [2018-04-10 16:20:17,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:20:17,521 INFO L459 AbstractCegarLoop]: Abstraction has 236 states and 269 transitions. [2018-04-10 16:20:17,521 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-10 16:20:17,521 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 269 transitions. [2018-04-10 16:20:17,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-10 16:20:17,521 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:20:17,521 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:20:17,522 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:20:17,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1591944237, now seen corresponding path program 1 times [2018-04-10 16:20:17,522 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:20:17,522 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:20:17,523 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:20:17,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:20:17,523 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:20:17,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:20:17,527 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:20:17,601 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:20:17,601 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:20:17,601 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:20:17,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:20:17,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:20:17,615 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:20:17,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 6 treesize of output 5 [2018-04-10 16:20:17,649 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:17,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:20:17,653 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:13 [2018-04-10 16:20:17,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 11 treesize of output 8 [2018-04-10 16:20:17,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:20:17,695 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:17,696 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:20:17,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:20:17,703 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2018-04-10 16:20:17,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2018-04-10 16:20:17,723 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:20:17,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-10 16:20:17,724 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:17,728 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:20:17,734 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:20:17,735 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:29 [2018-04-10 16:20:17,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2018-04-10 16:20:17,801 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:17,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:20:17,809 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:30 [2018-04-10 16:20:17,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-04-10 16:20:17,840 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:20:17,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-04-10 16:20:17,841 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:17,844 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:20:17,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-10 16:20:17,850 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:4 [2018-04-10 16:20:17,884 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-10 16:20:17,884 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:20:17,884 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [9] total 20 [2018-04-10 16:20:17,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-10 16:20:17,885 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-10 16:20:17,885 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2018-04-10 16:20:17,885 INFO L87 Difference]: Start difference. First operand 236 states and 269 transitions. Second operand 20 states. [2018-04-10 16:20:18,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:20:18,716 INFO L93 Difference]: Finished difference Result 301 states and 329 transitions. [2018-04-10 16:20:18,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-10 16:20:18,716 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 41 [2018-04-10 16:20:18,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:20:18,717 INFO L225 Difference]: With dead ends: 301 [2018-04-10 16:20:18,717 INFO L226 Difference]: Without dead ends: 301 [2018-04-10 16:20:18,717 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=251, Invalid=1641, Unknown=0, NotChecked=0, Total=1892 [2018-04-10 16:20:18,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-04-10 16:20:18,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 251. [2018-04-10 16:20:18,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-04-10 16:20:18,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 283 transitions. [2018-04-10 16:20:18,721 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 283 transitions. Word has length 41 [2018-04-10 16:20:18,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:20:18,721 INFO L459 AbstractCegarLoop]: Abstraction has 251 states and 283 transitions. [2018-04-10 16:20:18,721 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-10 16:20:18,721 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 283 transitions. [2018-04-10 16:20:18,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-10 16:20:18,722 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:20:18,722 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:20:18,722 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:20:18,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1176462409, now seen corresponding path program 2 times [2018-04-10 16:20:18,722 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:20:18,722 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:20:18,723 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:20:18,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:20:18,723 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:20:18,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:20:18,731 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:20:18,736 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:20:18,736 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:20:18,736 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:20:18,737 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 16:20:18,763 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 16:20:18,763 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:20:18,766 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:20:18,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:20:18,780 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:18,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:20:18,782 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-10 16:20:18,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:20:18,787 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:18,796 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:20:18,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-10 16:20:18,797 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:18,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:20:18,804 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:19 [2018-04-10 16:20:18,830 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:20:18,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-10 16:20:18,831 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:18,844 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:20:18,845 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:20:18,845 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:20:18,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 34 [2018-04-10 16:20:18,846 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:18,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:20:18,858 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:42 [2018-04-10 16:20:18,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:20:18,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:20:18,876 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:18,877 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:20:18,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:20:18,887 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:46 [2018-04-10 16:20:18,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 38 [2018-04-10 16:20:18,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2018-04-10 16:20:18,936 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:18,971 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:20:18,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-10 16:20:18,983 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:71, output treesize:67 [2018-04-10 16:20:19,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 34 [2018-04-10 16:20:19,057 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-10 16:20:19,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-10 16:20:19,071 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:82, output treesize:65 [2018-04-10 16:20:19,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 46 [2018-04-10 16:20:19,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 40 treesize of output 39 [2018-04-10 16:20:19,106 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:19,120 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:20:19,121 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:20:19,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 32 [2018-04-10 16:20:19,121 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:19,131 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:20:19,158 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:20:19,163 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 52 [2018-04-10 16:20:19,165 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:20:19,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 44 [2018-04-10 16:20:19,166 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:19,172 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:20:19,174 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:20:19,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 61 treesize of output 85 [2018-04-10 16:20:19,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 69 [2018-04-10 16:20:19,188 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:19,212 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:20:19,234 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2018-04-10 16:20:19,234 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:99, output treesize:159 [2018-04-10 16:20:19,468 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:20:19,469 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:20:19,470 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:20:19,471 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:20:19,472 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:20:19,472 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:20:19,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 124 [2018-04-10 16:20:19,473 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:19,599 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:20:19,599 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:20:19,600 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:20:19,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 65 [2018-04-10 16:20:19,603 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:20:19,608 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 44 [2018-04-10 16:20:19,609 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-10 16:20:19,623 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:20:19,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2018-04-10 16:20:19,624 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:19,625 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:20:19,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 53 [2018-04-10 16:20:19,630 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-10 16:20:19,653 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-10 16:20:19,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 62 [2018-04-10 16:20:19,689 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:20:19,690 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:20:19,690 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:20:19,690 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:20:19,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 33 [2018-04-10 16:20:19,691 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:19,742 INFO L267 ElimStorePlain]: Start of recursive call 7: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:20:19,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 62 [2018-04-10 16:20:19,760 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:20:19,761 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:20:19,762 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:20:19,762 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:20:19,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 36 [2018-04-10 16:20:19,763 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 16:20:19,816 INFO L267 ElimStorePlain]: Start of recursive call 9: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:20:19,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 2 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:20:19,835 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 17 variables, input treesize:240, output treesize:10 [2018-04-10 16:20:19,860 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:20:19,860 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:20:19,860 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-10 16:20:19,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-10 16:20:19,860 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-10 16:20:19,860 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-04-10 16:20:19,861 INFO L87 Difference]: Start difference. First operand 251 states and 283 transitions. Second operand 18 states. [2018-04-10 16:20:22,679 WARN L151 SmtUtils]: Spent 131ms on a formula simplification. DAG size of input: 126 DAG size of output 114 [2018-04-10 16:20:23,294 WARN L151 SmtUtils]: Spent 128ms on a formula simplification. DAG size of input: 159 DAG size of output 126 [2018-04-10 16:20:23,598 WARN L151 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 139 DAG size of output 125 [2018-04-10 16:20:23,818 WARN L151 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 181 DAG size of output 107 [2018-04-10 16:20:24,017 WARN L151 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 176 DAG size of output 102 [2018-04-10 16:20:24,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:20:24,411 INFO L93 Difference]: Finished difference Result 275 states and 299 transitions. [2018-04-10 16:20:24,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-10 16:20:24,411 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 42 [2018-04-10 16:20:24,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:20:24,412 INFO L225 Difference]: With dead ends: 275 [2018-04-10 16:20:24,412 INFO L226 Difference]: Without dead ends: 275 [2018-04-10 16:20:24,412 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=250, Invalid=940, Unknown=0, NotChecked=0, Total=1190 [2018-04-10 16:20:24,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-04-10 16:20:24,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 241. [2018-04-10 16:20:24,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-04-10 16:20:24,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 268 transitions. [2018-04-10 16:20:24,414 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 268 transitions. Word has length 42 [2018-04-10 16:20:24,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:20:24,414 INFO L459 AbstractCegarLoop]: Abstraction has 241 states and 268 transitions. [2018-04-10 16:20:24,414 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-10 16:20:24,414 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 268 transitions. [2018-04-10 16:20:24,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-10 16:20:24,414 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:20:24,414 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:20:24,415 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr51RequiresViolation, mainErr55AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr56EnsuresViolationMEMORY_LEAK, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr54AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:20:24,415 INFO L82 PathProgramCache]: Analyzing trace with hash -92088635, now seen corresponding path program 1 times [2018-04-10 16:20:24,415 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:20:24,415 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:20:24,415 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:20:24,415 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:20:24,415 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:20:24,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-04-10 16:20:24,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-04-10 16:20:24,436 INFO L421 BasicCegarLoop]: Counterexample might be feasible [2018-04-10 16:20:24,447 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-04-10 16:20:24,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.04 04:20:24 BoogieIcfgContainer [2018-04-10 16:20:24,457 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-10 16:20:24,458 INFO L168 Benchmark]: Toolchain (without parser) took 157805.11 ms. Allocated memory was 399.5 MB in the beginning and 754.5 MB in the end (delta: 354.9 MB). Free memory was 334.1 MB in the beginning and 503.9 MB in the end (delta: -169.8 MB). Peak memory consumption was 185.1 MB. Max. memory is 5.3 GB. [2018-04-10 16:20:24,459 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 399.5 MB. Free memory is still 359.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-10 16:20:24,459 INFO L168 Benchmark]: CACSL2BoogieTranslator took 257.04 ms. Allocated memory is still 399.5 MB. Free memory was 332.7 MB in the beginning and 305.0 MB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 5.3 GB. [2018-04-10 16:20:24,459 INFO L168 Benchmark]: Boogie Preprocessor took 44.13 ms. Allocated memory is still 399.5 MB. Free memory was 305.0 MB in the beginning and 302.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-10 16:20:24,459 INFO L168 Benchmark]: RCFGBuilder took 492.80 ms. Allocated memory was 399.5 MB in the beginning and 606.1 MB in the end (delta: 206.6 MB). Free memory was 302.3 MB in the beginning and 525.7 MB in the end (delta: -223.3 MB). Peak memory consumption was 23.5 MB. Max. memory is 5.3 GB. [2018-04-10 16:20:24,459 INFO L168 Benchmark]: TraceAbstraction took 157008.30 ms. Allocated memory was 606.1 MB in the beginning and 754.5 MB in the end (delta: 148.4 MB). Free memory was 525.7 MB in the beginning and 503.9 MB in the end (delta: 21.8 MB). Peak memory consumption was 170.2 MB. Max. memory is 5.3 GB. [2018-04-10 16:20:24,460 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.21 ms. Allocated memory is still 399.5 MB. Free memory is still 359.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 257.04 ms. Allocated memory is still 399.5 MB. Free memory was 332.7 MB in the beginning and 305.0 MB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 44.13 ms. Allocated memory is still 399.5 MB. Free memory was 305.0 MB in the beginning and 302.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 492.80 ms. Allocated memory was 399.5 MB in the beginning and 606.1 MB in the end (delta: 206.6 MB). Free memory was 302.3 MB in the beginning and 525.7 MB in the end (delta: -223.3 MB). Peak memory consumption was 23.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 157008.30 ms. Allocated memory was 606.1 MB in the beginning and 754.5 MB in the end (delta: 148.4 MB). Free memory was 525.7 MB in the beginning and 503.9 MB in the end (delta: 21.8 MB). Peak memory consumption was 170.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 986]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L989] EXPR, FCALL malloc(sizeof(SLL)) VAL [malloc(sizeof(SLL))={14:0}] [L989] SLL* head = malloc(sizeof(SLL)); VAL [head={14:0}, malloc(sizeof(SLL))={14:0}] [L990] FCALL head->next = ((void*)0) VAL [head={14:0}, malloc(sizeof(SLL))={14:0}] [L991] FCALL head->prev = ((void*)0) VAL [head={14:0}, malloc(sizeof(SLL))={14:0}] [L992] FCALL head->data = 0 VAL [head={14:0}, malloc(sizeof(SLL))={14:0}] [L994] SLL* x = head; VAL [head={14:0}, malloc(sizeof(SLL))={14:0}, x={14:0}] [L997] COND FALSE !(__VERIFIER_nondet_int()) [L1008] COND FALSE !(__VERIFIER_nondet_int()) [L1018] x = head VAL [head={14:0}, malloc(sizeof(SLL))={14:0}, x={14:0}] [L1019] EXPR, FCALL x->next VAL [head={14:0}, malloc(sizeof(SLL))={14:0}, x={14:0}, x->next={0:0}] [L1019] COND FALSE !(x->next != ((void*)0)) [L1026] EXPR, FCALL x->next VAL [head={14:0}, malloc(sizeof(SLL))={14:0}, x={14:0}, x->next={0:0}] [L1026] SLL* y = x->next; [L1027] EXPR, FCALL malloc(sizeof(SLL)) VAL [head={14:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}, x={14:0}, y={0:0}] [L1027] FCALL x->next = malloc(sizeof(SLL)) VAL [head={14:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}, x={14:0}, y={0:0}] [L1028] FCALL x->data = 1 VAL [head={14:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}, x={14:0}, y={0:0}] [L1029] FCALL x->next = y VAL [head={14:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}, x={14:0}, y={0:0}] [L1030] COND FALSE !(y != ((void*)0)) VAL [head={14:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}, x={14:0}, y={0:0}] [L1038] x = head VAL [head={14:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}, x={14:0}, y={0:0}] [L1041] EXPR, FCALL x->data VAL [head={14:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}, x={14:0}, x->data=1, y={0:0}] [L1041] COND FALSE !(x->data != 1) [L1047] EXPR, FCALL x->next VAL [head={14:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}, x={14:0}, x->next={0:0}, y={0:0}] [L1047] x = x->next [L1048] COND FALSE !(\read(*x)) VAL [head={14:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}, x={0:0}, y={0:0}] [L1056] x = head VAL [head={14:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}, x={14:0}, y={0:0}] [L1057] COND TRUE x != ((void*)0) [L1059] head = x VAL [head={14:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}, x={14:0}, y={0:0}] [L1060] EXPR, FCALL x->next VAL [head={14:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}, x={14:0}, x->next={0:0}, y={0:0}] [L1060] x = x->next [L1061] free(head) VAL [head={14:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}, x={0:0}, y={0:0}] [L1061] free(head) VAL [head={14:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}, x={0:0}, y={0:0}] [L1061] FCALL free(head) VAL [head={14:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}, x={0:0}, y={0:0}] [L1057] COND FALSE !(x != ((void*)0)) VAL [head={14:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}, x={0:0}, y={0:0}] [L1064] return 0; VAL [\result=0, head={14:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}, x={0:0}, y={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 135 locations, 57 error locations. UNSAFE Result, 156.9s OverallTime, 29 OverallIterations, 3 TraceHistogramMax, 123.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2569 SDtfs, 7949 SDslu, 8584 SDs, 0 SdLazy, 13239 SolverSat, 1000 SolverUnsat, 16 SolverUnknown, 0 SolverNotchecked, 10.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 799 GetRequests, 336 SyntacticMatches, 5 SemanticMatches, 458 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1971 ImplicationChecksByTransitivity, 133.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=251occurred in iteration=27, 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, 28 MinimizatonAttempts, 1434 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 32.4s InterpolantComputationTime, 1327 NumberOfCodeBlocks, 1327 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 795 ConstructedInterpolants, 134 QuantifiedInterpolants, 687339 SizeOfPredicates, 197 NumberOfNonLiveVariables, 2209 ConjunctsInSsa, 457 ConjunctsInUnsatCore, 29 InterpolantComputations, 22 PerfectInterpolantSequences, 29/55 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-10_16-20-24-464.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-10_16-20-24-464.csv [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...